Dense random regular digraphs: singularity of the adjacency matrix
arXiv:1403.5845
Abstract
Fix and let be a -regular digraph on vertices drawn uniformly at random. We prove that when is large, the (non-symmetric) adjacency matrix of is invertible with high probability. The proof uses a couplings approach based on the switchings method of McKay and Wormald. We also rely on discrepancy properties for the distribution of edges in , recently proved by the author, to overcome certain difficulties stemming from the dependencies between the entries of .
arXiv commentThe paper has been withdrawn by the author as it is superseded by arXiv:1411.0243
References in corpus (6)
- Spectral measure of large random Hankel, Markov and Toeplitz matrices
- Universality and the circular law for sparse random matrices
- Circular law for random matrices with exchangeable entries
- Functional limit theorems for random regular graphs
- Random doubly stochastic matrices: The circular law
- Circular law for random matrices with unconditional log-concave distribution