Sparse random graphs: Eigenvalues and Eigenvectors
Combinatorics
2010-12-01 v1 Probability
Abstract
In this paper we prove the semi-circular law for the eigenvalues of regular random graph in the case , complementing a previous result of McKay for fixed . We also obtain a upper bound on the infinity norm of eigenvectors of Erd\H{o}s-R\'enyi random graph , answering a question raised by Dekel-Lee-Linial.
Cite
@article{arxiv.1011.6646,
title = {Sparse random graphs: Eigenvalues and Eigenvectors},
author = {Linh Tran and Van Vu and Ke Wang},
journal= {arXiv preprint arXiv:1011.6646},
year = {2010}
}
Comments
30 pages, 3 figures