Sparse random graphs: Eigenvalues and eigenvectors

Random Structures and Algorithms

Volumn 42, Issue 1, 2013, Pages 110-134

  Tran, Linh V ^a   Vu, Van H ^a   Wang, Ke ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

Infinity norm of eigenvector; Regular random graphs; Semi circular law; Sparse random matrix

Indexed keywords

EID: 84869866464     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20406     Document Type: Article

References (34)

1. Z. D. Bai, Methodologies in spectral analysis of large dimensional random matrices, a review, In Advances in statistics: Proceedings of the conference in honor of Professor Zhidong Bai on his 65th birthday, National University of Singapore, 20 July 2008, Vol. 9, World Scientific Pub. Co. Inc., Singapore, 2008, p. 174.
2. M. Bauer, O. Golinelli, Random incidence matrices: Moments of the spectral density, J Stat Phys 103 ( 2001), 301-337.
3. S. Bhamidi, S. N. Evans, A. Sen, Spectra of large random trees, Arxiv preprint arXiv:0903.3589, 2009.
4. B. Bollobás, Random graphs, Cambridge University Press, 2001.
5. S. Brooks, E. Lindenstrauss, Non-localization of eigenfunctions on large regular graphs, Arxiv preprint arXiv:0912.3239, 2009.
6. F. Chung, L. Lu, V. Vu, The spectra of random graphs with given expected degrees, Internet Math 1 ( 2004), 257-275.
7. Y. Dekel, J. Lee, N. Linial, Eigenvectors of random graphs: Nodal domains, In Approx '07/Random '07: Proceedings of the 10th international workshop on approximation and the 11th international workshop on randomization, and combinatorial optimization. Algorithms and techniques, Springer-Verlag, Berlin, Heidelberg, Germany, 2007, pp. 436-448.
8. Y. Dekel, J. Lee, N. Linial, Eigenvectors of random graphs: Nodal domains, Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 2008, pp. 436-448.
9. I. Dumitriu, S. Pal, Sparse regular random graphs: Spectral density and eigenvectors, Arxiv preprint arXiv:0910.5306, 2009.
10. L. Erdos, B. Schlein, H. T. Yau, Semicircle law on short scales and delocalization of eigenvectors for Wigner random matrices, Ann Probab 37 ( 2009), 815-852.
11. L. Erdos, B. Schlein, H. T. Yau, Local semicircle law and complete delocalization for Wigner random matrices, Commun Math Phys 287 ( 2010), 641-655.
12. U. Feige, E. Ofek, Spectral techniques applied to sparse random graphs, Rand Struct Alg 27 ( 2005), 251-275.
13. J. Friedman, On the second eigenvalue and random walks in random d -regular graphs, Combinatorica 11 ( 1991), 331-362.
14. J. Friedman, Some geometric aspects of graphs and their eigenfunctions, Duke Math J 69 ( 1993), 487-525.
15. J. Friedman, A proof of Alon's second eigenvalue conjecture, In Proceedings of the thirty-fifth annual ACM symposium on theory of computing, ACM, 2003, pp. 720-724.
16. Z. Füredi, J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica 1 ( 1981), 233-241.
17. F. Götze, A. Tikhomirov, Rate of convergence to the semi-circular law, Probab Theory Relat Fields 127 ( 2003), 228-276.
18. A. Guionnet, O. Zeitouni, Concentration of the spectral measure for large matrices, Electron Commun Probab 5 ( 2000), 119-136.
19. S. Janson, T. Luczak, A. Ruciński, Random graphs, Citeseer, Wiley-Interscience, New York, US, 2000.
20. M. Krivelevich, B. Sudakov, V. H. Vu, N. C. Wormald, Random regular graphs of high degree, Rand Struct Alg 18 ( 2001), 346-363.
21. B. D. McKay, The expected eigenvalue distribution of a large regular graph, Linear Algebra Appl 40 ( 1981), 203-216.
22. 1/2), Combinatorica 11 ( 1991), 369-382.
23. B. D. McKay, N. C. Wormald, The degree sequence of a random graph. I. The models, Rand Struct Alg 11 ( 1997), 97-117.
24. A. Pothen, H. D. Simon, K. P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J Matrix Anal Appl 11 ( 1990), 430-452.
25. G. Semerjian, L. F. Cugliandolo, Sparse random matrices: The eigenvalue spectrum revisited, J Phys A: Math Gen 35 ( 2002), 4837-4851.
26. E. Shamir, E. Upfal, Large regular factors in random graphs, Convexity and graph theory (Jerusalem, 1981), North Holland, Amsterdam-New York-Oxford, 1981.
27. J. Shi, J. Malik, Normalized cuts and image segmentation, IEEE Trans Pattern Anal Machine Intell 22 ( 2000), 888-905.
28. G. W. Stewart, J.-G. Sun, Matrix perturbation theory, Academic Press, New York, 1990.
29. T. Tao, V. Vu, Random matrices: The distribution of the smallest singular values, Geometric Funct Anal 20 ( 2010), 260-297.
30. T. Tao, V. Vu, Random matrices: Universality of local eigenvalue statistics up to the edge, Commun Math Phys 298 ( 2010), 1-24.
31. T. Tao, V. Vu, Random matrices: Universality of the local eigenvalue statistics, Acta Math 206 ( 2011), 127-204.
32. V. Vu, Random discrete matrices, Bolyai Soc Math Stud 17 ( 2008), 257-280.
33. E. P. Wigner, On the distribution of the roots of certain symmetric matrices, Ann Math 67 ( 1958), 325-327.
34. N. C. Wormald, Models of random regular graphs, In London mathematical society lecture note series, Vol. 267, Cambridge University Press, Cambridge, 1999, pp. 239-298.