|
Math @ Duke
|
Publications [#350412] of Nicholas A Cook
search arxiv.org.Papers Published
- Cook, NA, On the singularity of adjacency matrices for random regular digraphs,
Probability Theory and Related Fields, vol. 167 no. 1-2
(February, 2017),
pp. 143-200 [doi]
(last updated on 2026/01/15)
Abstract: We prove that the (non-symmetric) adjacency matrix of a uniform random d-regular directed graph on n vertices is asymptotically almost surely invertible, assuming min (d, n- d) ≥ Clog 2n for a sufficiently large constant C> 0. The proof makes use of a coupling of random regular digraphs formed by “shuffling” the neighborhood of a pair of vertices, as well as concentration results for the distribution of edges, proved in Cook (Random Struct Algorithms. arXiv:1410.5595, 2014). We also apply our general approach to prove asymptotically almost surely invertibility of Hadamard products Σ∘ Ξ, where Ξ is a matrix of iid uniform ± 1 signs, and Σ is a 0/1 matrix whose associated digraph satisfies certain “expansion” properties.
|
|
|
|
dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
| |
Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320
|
|