Edge universality of random regular graphs of growing degrees
We consider the statistics of extreme eigenvalues of random d-regular graphs, with Nc≤d≤N1/3−c for arbitrarily small c>0. We prove that in this regime, the fluctuations of extreme eigenvalues are given by the Tracy–Widom distribution. As a consequence, about 69% of d-regular graphs have all nontrivial eigenvalues bounded in absolute value by 2 d−1.
Authors
- Jiaoyang Huang (ORCID: https://orcid.org/0000-0001-8266-1301)
- Horng‐Tzer Yau (ORCID: https://orcid.org/0009-0002-6671-0833)
Institutions
- Harvard University (US)
- University of Pennsylvania (US)
Publication Details
- Journal
- The Annals of Probability
- Published
- 2026-08-28
- DOI
- https://doi.org/10.1214/25-aop1807
- Citations
- 1
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation