REVIEW 11 cited by
Ramanujan Property and Edge Universality of Random Regular Graphs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Ramanujan Property and Edge Universality of Random Regular Graphs
abstract
We consider the normalized adjacency matrix of a random $d$-regular graph on $N$ vertices with any fixed degree $d\geq 3$ and denote its eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We establish the following two results as $N\rightarrow \infty$. (i) With high probability, all eigenvalues are optimally rigid, up to an additional $N^{{\rm o}(1)}$ factor. Specifically, the fluctuations of bulk eigenvalues are bounded by $N^{-1+{\rm o}(1)}$, and the fluctuations of edge eigenvalues are bounded by $N^{-2/3+{\rm o}(1)}$. (ii) Edge universality holds for random $d$-regular graphs. That is, the distributions of $\lambda_2$ and $-\lambda_N$ converge to the Tracy-Widom$_1$ distribution associated with the Gaussian Orthogonal Ensemble. As a consequence, for sufficiently large $N$, approximately $69\%$ of $d$-regular graphs on $N$ vertices are Ramanujan, meaning $\max\{\lambda_2,|\lambda_N|\}\leq 2$.
Forward citations
Cited by 11 Pith papers
-
Loop Equations Characterize Random Matrix Statistics
For rational beta>0, the Sine-beta and Airy-beta point processes are the unique solutions of the bulk and edge loop equation hierarchies respectively.
-
Edge Universality for Inhomogeneous Random Matrices II: Markov Chain Comparison and Critical Statistics
Inhomogeneous random matrices have identical universal edge statistics if their variance-profile Markov chains satisfy short-to-long comparability, enabling analysis of band matrices, orbital models, and Hankel profil...
-
On Spielman's Laplacian Eigenratio Conjecture and Related Problems
Spielman's Laplacian eigenratio conjecture is disproved for infinitely many d>2 using Ramanujan graphs but verified for d≤2 and regular graphs, with stronger results and resolutions of two other conjectures.
-
Nearly optimal spectral gaps for random Belyi surfaces
Random Brooks–Makover surfaces have first Laplacian eigenvalue > 1/4 − ε with probability → 1 for every ε > 0.
-
Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes
Almost-good qLDPC and qLTC codes admit nontrivial transversal logical multi-controlled-Z gates via cohomological cup products and two-way product-expanding punctured Reed–Solomon local codes.
-
Asymptotic Brill-Noether Existence at the Half-Canonical Degree: Energy Pairing, Cheeger Inequality and Covering Radii
For expander, almost-Ramanujan, and random regular graphs, the paper claims asymptotic Brill-Noether existence at half-canonical degree, up to a constant factor.
-
Deconfinement For $\mathrm{SO}(3)$ Lattice Yang-Mills at Strong Coupling
Proves that SO(3) lattice Yang-Mills theory fails Wilson's confinement criterion at strong coupling.
-
Spectral Theory of Isogeny Graphs
Proves eigenvalue bounds implying that isogeny graphs of supersingular elliptic curves are Ramanujan and studies their spectral distribution, components, automorphisms, and links to modular forms.
-
Discrete Mixed Quantization
Develops a mixed quantization technique for graph vector bundles and applies it to the Alon-Boppana bound, Kesten-McKay law, asymptotic determinant, quantum ergodicity, zero divisor convergence, and Ramanujan vector bundles.
-
Discrete Mixed Quantization
Develops mixed quantization for graph vector bundles and applies it to asymptotic spectral problems including Alon-Boppana bound, Kesten-McKay law, and quantum ergodicity.
-
Bass notes of random hyperbolic surfaces of large genus
A survey of recent results proving that random hyperbolic surfaces of large genus have near-optimal spectral gaps, after Hide–Magee, Anantharaman–Monk, and Hide–Macera–Thomas.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.