2000 character limit reached
Gaussian Waves and Edge Eigenvectors of Random Regular Graphs (2502.08897v1)
Published 13 Feb 2025 in math.PR, math-ph, math.CO, math.MP, and math.SP
Abstract: Backhausz and Szegedy (2019) demonstrated that the almost eigenvectors of random regular graphs converge to Gaussian waves with variance $0\leq \sigma2\leq 1$. In this paper, we present an alternative proof of this result for the edge eigenvectors of random regular graphs, establishing that the variance must be $\sigma2=1$. Furthermore, we show that the eigenvalues and eigenvectors are asymptotically independent. Our approach introduces a simple framework linking the weak convergence of the imaginary part of the Green's function to the convergence of eigenvectors, which may be of independent interest.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.