English

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 Gn,dG_{n,d} in the case dd\rightarrow \infty, complementing a previous result of McKay for fixed dd. We also obtain a upper bound on the infinity norm of eigenvectors of Erd\H{o}s-R\'enyi random graph G(n,p)G(n,p), answering a question raised by Dekel-Lee-Linial.

Keywords

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

R2 v1 2026-06-21T16:51:18.514Z