EUVIMEDEUVIMED entdecken
Crossref

Limit vectors of the top k eigenvalues of d-regular graphs

Dingding Dong, Theo McKenzie

Advances in Mathematics · 2026-07 · 499 · 111047

DOI: 10.1016/j.aim.2026.111047 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Advances in Mathematics, 2026-07. Verfasst von Dingding Dong und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: Stanford University, California Institute of Technology.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We prove that for each $d\geq 3$ and $k\geq 2$, the set of limit points of the first $k$ eigenvalues of sequences of $d$-regular graphs is \[ \{(\mu_1,\dots,\mu_k): d=\mu_1\geq \dots\geq \mu_{k}\geq2\sqrt{d-1}\}. \] The result for $k=2$ was obtained by Alon and Wei, and our result confirms a conjecture of theirs. Our proof uses an infinite random graph sampled from a distribution that generalizes the random regular graph distribution. To control the spectral behavior of this infinite object, we show that Huang and Yau's proof of Friedman's theorem bounding the second eigenvalue of a random regular graph generalizes to this model. We also bound the trace of the non-backtracking operator, as was done in Bordenave's separate proof of Friedman's theorem.

Förderung

  • Stanford University
  • California Institute of Technology

Zitieren

APA

Dong, D., & McKenzie, T. (2026). Limit vectors of the top k eigenvalues of d-regular graphs. Advances in Mathematics, 499, 111047. https://doi.org/10.1016/j.aim.2026.111047

Vancouver

Dong D, McKenzie T. Limit vectors of the top k eigenvalues of d-regular graphs. Advances in Mathematics. 2026;499:111047. doi:10.1016/j.aim.2026.111047

BibTeX
@article{Dong2026,
  author = {Dong, Dingding and McKenzie, Theo},
  title = {Limit vectors of the top k eigenvalues of d-regular graphs},
  journal = {Advances in Mathematics},
  year = {2026},
  volume = {499},
  pages = {111047},
  doi = {10.1016/j.aim.2026.111047}
}
Kostenlos starten →