Spectrum of random d ‐regular graphs up to the edge
Communications on Pure and Applied Mathematics · 2024-03 · 77 (3) · 1635-1723
DOI: 10.1002/cpa.22176 ↗Kurz gefasst
Fachartikel in der Zeitschrift Communications on Pure and Applied Mathematics, online erschienen am 28.09.2023. Verfasst von Jiaoyang Huang und 1 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 79 Literaturangaben. Gefördert von: Simons Foundation, National Science Foundation.
Abstract (Originalsprache)
Consider the normalized adjacency matrices of random d ‐regular graphs on N vertices with fixed degree . We prove that, with probability for any , the following two properties hold as provided that : (i) The eigenvalues are close to the classical eigenvalue locations given by the Kesten–McKay distribution. In particular, the extremal eigenvalues are concentrated with polynomial error bound in N , that is, . (ii) All eigenvectors of random d ‐regular graphs are completely delocalized.
Förderung
- Simons Foundation
- National Science Foundation
Zitieren
APA
Huang, J., & Yau, H. (2024). Spectrum of random d ‐regular graphs up to the edge. Communications on Pure and Applied Mathematics, 77(3), 1635-1723. https://doi.org/10.1002/cpa.22176
Vancouver
Huang J, Yau H. Spectrum of random d ‐regular graphs up to the edge. Communications on Pure and Applied Mathematics. 2024;77(3):1635-1723. doi:10.1002/cpa.22176
BibTeX
@article{Huang2024,
author = {Huang, Jiaoyang and Yau, Horng‐Tzer},
title = {Spectrum of random d ‐regular graphs up to the edge},
journal = {Communications on Pure and Applied Mathematics},
year = {2024},
volume = {77},
number = {3},
pages = {1635--1723},
doi = {10.1002/cpa.22176}
}
EUVIMED