科研速览 · Science Skim继续刷下去 · Keep skimming →
◆ The Annals of Probability2026-08-28· Eigenvalues and eigenvectors

Edge universality of random regular graphs of growing degrees

Jiaoyang Huang, Horng‐Tzer Yau

原始摘要(英文原文)· Original 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.
读原文 · Read the paper ↗

AI 追问PRO

登录后使用 AI 追问

讨论区

登录后参与讨论

相关论文 · Related

Edge universality of random regular graphs of growing degrees — 科研速览 Science Skim