Sparse regular random graphs: spectral density and eigenvectors

From MaRDI portal
Publication:690878

DOI10.1214/11-AOP673zbMATH Open1255.05173arXiv0910.5306MaRDI QIDQ690878FDOQ690878


Authors: Ioana Dumitriu, Soumik Pal Edit this on Wikidata


Publication date: 29 November 2012

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: We examine the empirical distribution of the eigenvalues and the eigenvectors of adjacency matrices of sparse regular random graphs. We find that when the degree sequence of the graph slowly increases to infinity with the number of vertices, the empirical spectral distribution converges to the semicircle law. Moreover, we prove concentration estimates on the number of eigenvalues over progressively smaller intervals. We also show that, with high probability, all the eigenvectors are delocalized.


Full work available at URL: https://arxiv.org/abs/0910.5306




Recommendations




Cites Work


Cited In (61)





This page was built for publication: Sparse regular random graphs: spectral density and eigenvectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690878)