Back to Search
Start Over
Circular law for sparse random regular digraphs.
- Source :
- Journal of the European Mathematical Society (EMS Publishing); 2021, Vol. 23 Issue 2, p467-501, 35p
- Publication Year :
- 2021
-
Abstract
- Fix a constant C ≥ 1 and let d = d(n) satisfy d ≤ ln<superscript>C</superscript> n for every large integer n. Denote by An the adjacency matrix of a uniform random directed d-regular graph on n vertices. We show that if d → ∞ as n → ∞, the empirical spectral distribution of the appropriately rescaled matrix An converges weakly in probability to the circular law. This result, together with an earlier work of Cook, completely settles the problem of weak convergence of the empirical distribution in a directed d -regular setting with the degree tending to infinity. As a crucial element of our proof, we develop a technique of bounding intermediate singular values of An based on studying random normals to rowspaces and on constructing a product structure to deal with the lack of independence between matrix entries. [ABSTRACT FROM AUTHOR]
- Subjects :
- DIRECTED graphs
RANDOM graphs
SPARSE matrices
PROOF theory
MATHEMATICAL formulas
Subjects
Details
- Language :
- English
- ISSN :
- 14359855
- Volume :
- 23
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Journal of the European Mathematical Society (EMS Publishing)
- Publication Type :
- Academic Journal
- Accession number :
- 157509861
- Full Text :
- https://doi.org/10.4171/JEMS/1015