On the singularity of adjacency matrices for random regular digraphs

From MaRDI portal
(Redirected from Publication:510262)




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,nd)geClog2n 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 recently obtained by the author (arXiv:1410.5595). We also apply our general approach to prove a.a.s. invertibility of Hadamard products SigmacircXi, where Xi is a matrix of iid uniform pm1 signs, and Sigma is a 0/1 matrix whose associated digraph satisfies certain "expansion" properties.



Cites work


Cited in
(31)






This page was built for publication: On the singularity of adjacency matrices for random regular digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510262)