Sparse random graphs: Eigenvalues and eigenvectors

@article{Tran2013SparseRG,
  title={Sparse random graphs: Eigenvalues and eigenvectors},
  author={Linh V. Tran and Van H. Vu and Ke Wang},
  journal={Random Struct. Algorithms},
  year={2013},
  volume={42},
  pages={110-134}
}
In this paper we prove the semi-circular law for the eigenvalues of regular random graph Gn,d in the case d→∞, complementing a previous result of McKay for fixed d. We also obtain a upper bound on the infinity norm of eigenvectors of Erdős-Rényi random graph G(n, p), answering a question raised by Dekel-Lee-Linial. 
Highly Cited
This paper has 45 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 34 references

Large regular factors in random graphs

  • E Shamir, E Upfal
  • Convexity and graph theory
  • 1981
Highly Influential
2 Excerpts

Random matrices : Universality of the local eigenvalue statistics , ( to appear )

  • V. Vu.
  • Acta Math
  • 2010

Random matrices: The distribution of the smallest singular values

  • T. Tao, V. Vu
  • Geometric And Functional Analysis, 20(1):260–297
  • 2010

Non-localization of eigenfunctions on large regular graphs

  • S. Brooks, E. Lindenstrauss
  • Arxiv preprint arXiv:0912.3239
  • 2009
2 Excerpts

Similar Papers

Loading similar papers…