arXiv:1806.10068 [math.PR]AbstractReferencesReviewsResources
Nonsingularity of adjacency matrices of random $r$-regular graphs
Hoi H. Nguyen, Melanie Matchett Wood
Published 2018-06-26Version 1
We prove that the adjacency matrices of uniform random r-regular graphs on n vertices are asymptotically almost surely nonsingular for even n. We use recent mixing results of M\'esz\'aros for adjacency matrices of certain random r-regular multi-graphs and results of the second author on the moment problem for random finite abelian groups.
Related articles: Most relevant | Search more
arXiv:1411.0243 [math.PR] (Published 2014-11-02)
On the singularity of adjacency matrices for random regular digraphs
arXiv:1807.06465 [math.PR] (Published 2018-07-16)
Invertibility of adjacency matrices for random $d$-regular graphs
arXiv:2003.08411 [math.PR] (Published 2020-03-18)
Entropy of the Gibbs state cannot distinguish complex graph models