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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Edge universality of random regular graphs of growing degrees

Jiaoyang Huang, Horng‐Tzer Yau
1 citations
The Annals of Probability
Graph theory and applications
article

Edge universality of random regular graphs of growing degrees

Jiaoyang Huang, Horng‐Tzer Yau
article en
1 citations

Abstract

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.

The Annals of ProbabilityVol. 54(5)
Harvard University (US), University of Pennsylvania (US)
National Science Foundation
Openalex Percentile: Top 98%
Graph theory and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.