Pith. sign in

REVIEW 6 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

arxiv 2412.20263 v2 pith:NF7EK7RP submitted 2024-12-28 math.PR math-phmath.COmath.MPmath.SP

classification math.PRmath-phmath.COmath.MPmath.SP
keywords lambdaeigenvaluesregularedgegraphsrandomboundedfluctuations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Loop Equations Characterize Random Matrix Statistics

    math.PR 2026-07 accept novelty 8.0 of 10

    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.

  2. Nearly optimal spectral gaps for random Belyi surfaces

    math.SP 2025-11 conditional novelty 8.0 of 10

    Random Brooks–Makover surfaces have first Laplacian eigenvalue > 1/4 − ε with probability → 1 for every ε > 0.

  3. Transversal non-Clifford gates on almost-good quantum LDPC and quantum locally testable codes

    quant-ph 2026-04 conditional novelty 7.5 of 10

    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.

  4. Asymptotic Brill-Noether Existence at the Half-Canonical Degree: Energy Pairing, Cheeger Inequality and Covering Radii

    math.CO 2026-07 reject novelty 7.0 of 10

    For expander, almost-Ramanujan, and random regular graphs, the paper claims asymptotic Brill-Noether existence at half-canonical degree, up to a constant factor.

  5. Gaussian Waves and Edge Eigenvectors of Random Regular Graphs

    math.PR 2025-02 conditional novelty 6.0 of 10

    Edge eigenvectors of random d-regular graphs converge to Gaussian waves with variance 1, jointly with and asymptotically independent of the Airy_1 edge eigenvalue process.

  6. Bass notes of random hyperbolic surfaces of large genus

    math.SP 2026-07 accept novelty 2.0 of 10

    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.

Pith tools