Sparse regular random graphs: Spectral density and eigenvectors

Annals of Probability

Volumn 40, Issue 5, 2012, Pages 2197-2235

  Dumitriu, Ioana ^a   Pal, Soumik ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Random regular graphs; Semicircle law; Spectral distribution; Universality

Indexed keywords

EID: 84872545463     PISSN: 00911798     EISSN: None     Source Type: Journal    
DOI: 10.1214/11-AOP673     Document Type: Article

References (61)

1. ALON, N., KRIVELEVICH, M. and VU, V. H. (2002). On the concentration of eigenvalues of random symmetric matrices. Israel J. Math. 131 259-267. 942311
2. ANDERSON, G. W., GUIONNET, A. and ZEITOUNI, O. (2010). An Introduction to Random Matrices. Cambridge Studies in Advanced Mathematics 118. Cambridge Univ. Press, Cambridge. MR2760897
3. BAI, Z. D. (1993). Convergence rate of expected spectral distributions of large random matrices. I. Wigner matrices. Ann. Probab. 21 625-648. 217559
4. BAI, Z. D., MIAO, B. Q. and PAN, G. M. (2007). On asymptotics of eigenvectors of large sample covariance matrix. Ann. Probab. 35 1532-1572. MR2330979
5. BAI, Z. D. and SILVERSTEIN, J. W. (2006). Spectral Analysis of Large Dimensional Random Matrices. Mathematics Monograph Series 2. Science Press, Beijing.
6. BAI, Z. D. andYAO, J. (2005). On the convergence of the spectral empirical process of Wigner matrices. Bernoulli 11 1059-1092. MR2189081
7. BAIK, J. and SUIDAN, T. M. (2005). A GUE central limit theorem and universality of directed first and last passage site percolation. Int. Math. Res. Not. IMRN 6 325-337. MR2131383
8. BAIK, J. and SUIDAN, T. M. (2007). Random matrix central limit theorems for nonintersecting random walks. Ann. Probab. 35 1807-1834. MR2349576
9. BAKER, T. H. and FORRESTER, P. J. (1997). The Calogero-Sutherland model and generalized classical polynomials. Comm. Math. Phys. 188 175-216. 471336
10. BAUER, M. and GOLINELLI, O. (2001). Random incidence matrices: Moments of the spectral density. J. Stat. Phys. 103 301-337.
11. BEN AROUS, G. and PÉCHÉ, S. (2005). Universality of local eigenvalue statistics for some sample covariance matrices. Comm. Pure Appl. Math. 58 1316-1357. MR2162782
12. BHAMIDI, S., EVANS, S. and SEN, A. (2008). Spectra of random large trees. Preprint. Available at arXiv:0903.3589v2.
13. BORDENAVE, C. and LELARGE, M. (2010). Resolvent of large random graphs. Random Structures Algorithms 37 332-352. MR2724665
14. BRIN, S. and LAWRENCE, P. (1998). The anatomy of a large-scale hypertextual Web search engine. In Proceedings of the Seventh International Conference on World Wide Web 7 107-117. Brisbane, Australia.
15. BRODER, A. and SHAMIR, E. (1987). On the second eigenvalue of random regular graphs. In 28th Annual Symposium on Foundations of Computer Science (Los Angeles, 1987) 286-294. IEEE Comput. Soc. Press, Washington, DC.
16. CHATTERJEE, S. (2006). A generalization of the Lindeberg principle. Ann. Probab. &34 &2061-2076. MR2294976
17. DEIFT, P. (2007). Universality for mathematical and physical systems. In International Congress of Mathematicians. Vol. I 125-152. Eur. Math. Soc., Zürich. MR2334189
18. DEIFT, P. and GIOEV, D. (2007). Universality at the edge of the spectrum for unitary, orthogonal, and symplectic ensembles of random matrices. Comm. Pure Appl. Math. 60 867-910. MR2306224
19. DEKEL, Y., LEE, J. R. and LINIAL, N. (2011). Eigenvectors of random graphs: Nodal domains. Random Structures Algorithms 39 3958.
20. DUMITRIU, I. and EDELMAN, A. (2006). Global spectrum fluctuations for the ß-Hermite and β-Laguerre ensembles via matrix models. J. Math. Phys. 47 063302, 36. MR2239975
21. ELON, Y. (2008). Eigenvectors of the discrete Laplacian on regular graphs-a statistical approach. J. Phys. A 41 435203, 17. MR2453165
22. ERDÓ S, L., KNOWLES, A., YAU, H. T. and YIN, J. (2011). Spectral statistics of Erdo?s-RÉnyi graphs I: Local semicircle law. Preprint. http://arxiv.org/abs/1103.1919.
23. ERDÓ S, L., PÉCHÉ, S., RAMíREZ, J. A., SCHLEIN, B. and YAU, H.-T. (2010). Bulk universality for Wigner matrices. Comm. Pure Appl. Math. 63 895-925. MR2662426
24. ERDÓ S, L., RAMíREZ, J., SCHLEIN, B., TAO, T., VU, V. and YAU, H.-T. (2010). Bulk universality for Wigner Hermitian matrices with subexponential decay. Math. Res. Lett. 17 667-674. MR2661171
25. ERDOáS, L., SCHLEIN, B. and YAU, H.-T. (2009). Semicircle law on short scales and delocalization of eigenvectors for Wigner random matrices. Ann. Probab. 37 815-852. MR2537522
26. ERDÓ S, L., SCHLEIN, B. and YAU, H.-T. (2009). Local semicircle law and complete delocalization for Wigner random matrices. Comm. Math. Phys. 287 641-655. MR2481753
27. ERDO? S, L., YAU, H. T. and YIN, J. (2010). Universality for generalizedWigner matrices with Bernoulli distribution. Preprint. Available at arXiv:1003.3813v4.
28. FEIGE, U. andOFEK, E. (2005). Spectral techniques applied to sparse random graphs. Random Structures Algorithms 27 251-275. MR2155709
29. FRIEDMAN, J. (1991). On the second eigenvalue and random walks in random d-regular graphs. Combinatorica 11 331-362.
30. FRIEDMAN, J. (1993). Some geometric aspects of graphs and their eigenfunctions. Duke Math. J. 69 487-525.
31. FRIEDMAN, J. (2008). A proof of Alon's second eigenvalue conjecture and related problems. Mem. Amer. Math. Soc. 195 viii+100. MR2437174
32. FüREDI, Z. and KOMLÓS, J. (1981). The eigenvalues of random symmetric matrices. Combinatorica 1 233-241. MR0637828
33. GUIONNET, A. and ZEITOUNI, O. (2000). Concentration of the spectral measure for large matrices. Electron. Commun. Probab. 5 119-136 (electronic). 1
34. JAKOBSON, D., MILLER, S. D., RIVIN, I. and RUDNICK, Z. (1999). Eigenvalue spacings for regular graphs. In Emerging Applications of Number Theory (Minneapolis, MN, 1996). IMA Vol. Math. Appl. 109 317-327. Springer, New York.
35. JOHANSSON, K. (1998). On fluctuations of eigenvalues of random Hermitian matrices. Duke Math. J. 91 151-204.
36. KESTEN, H. (1959). Symmetric random walks on groups. Trans. Amer. Math. Soc. 92 336-354. MR0109367
37. KHORUNZHY, A. (2001). Sparse random matrices: Spectral edge and statistics of rooted trees. Adv. in Appl. Probab. 33 124-140.
38. KHORUNZHY, A. M., KHORUZHENKO, B. A. and PASTUR, L. A. (1996). Asymptotic properties of large random matrices with independent entries. J. Math. Phys. 37 5033-5060.
39. KRIVELEVICH, M. and SUDAKOV, B. (2003). The largest eigenvalue of sparse random graphs. Combin. Probab. Comput. 12 61-72.
40. LORENTZEN, L. and WAADELAND, H. (2008). Continued Fractions. Vol. 1. Convergence Theory, 2nd ed. Atlantis Studies in Mathematics for Engineering and Science 1. Atlantis Press, Paris. MR2433845
41. LUBOTZKY, A., PHILLIPS, R. and SARNAK, P. (1988). Ramanujan graphs. Combinatorica 8 261-277. MR0963118
42. MASON, J. C. and HANDSCOMB, D. C. (2003). Chebyshev Polynomials. Chapman & Hall/CRC, Boca Raton, FL.
43. MCKAY, B. D. (1981). The expected eigenvalue distribution of a large regular graph. Linear Algebra Appl. 40 203-216. MR0629617
44. MCKAY, B. D. andWORMALD, N. C. (1997). The degree sequence of a random graph. I. The models. Random Structures Algorithms 11 97-117.
45. MCKAY, B. D., WORMALD, N. C. andWYSOCKA, B. (2004). Short cycles in random regular graphs. Electron. J. Combin. 11 12 pp. (electronic). MR2097332
46. MEHTA, M. L. (1991). Random Matrices, 2nd ed. Academic Press, Boston, MA.
47. MEILA, M. and SHI, J. (2011). Learning segmentation with random walks. In Adv. Neural Inf. Process. Syst. 14 873-879. MIT Press, Cambridge, MA.
48. MIRLIN, A. D. and FYODOROV, Y. V. (1991). Universality of level correlation function of sparse random matrices. J. Phys. A 24 2273-2286.
49. MORGENSTERN, M. (1994). Existence and explicit constructions of q +1 regular Ramanujan graphs for every prime power q. J. Combin. Theory Ser. B 62 44-62.
50. MUIRHEAD, R. J. (1982). Aspects of Multivariate Statistical Theory. Wiley, New York. MR0652932
51. POTHEN, A., SIMON, H. D. and LIOU, K.-P. (1990). Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11 430-452.
52. SEMERJIAN, G. and CUGLIANDOLO, L. F. (2002). Sparse random matrices: The eigenvalue spectrum revisited. J. Phys. A 35 4837-4851.
53. SHI, J. and MALIK, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22 888-905.
54. SOSHNIKOV, A. (1999). Universality at the edge of the spectrum in Wigner random matrices. Comm. Math. Phys. 207 697-733.
55. TAO, T. and VU, V. (2010). Random matrices: Universality of local eigenvalue statistics up to the edge. Comm. Math. Phys. 298 549-572. MR2669449
56. TAO, T. and VU, V. (2011). Random matrices: Universality of local eigenvalue statistics. Acta Math. To appear. Available at arXiv:0906.0510v10.
57. TRACY, C. A. and WIDOM, H. (1999). Universality of the distribution functions of random matrix theory. In Statistical Physics on the Eve of the 21st Century. Series on Advances in Statistical Mechanics &14 &230-239. World Sci. Publishing, River Edge, NJ.ss
58. TRACY, C. A. and WIDOM, H. (2000). Universality of the distribution functions of random matrix theory. In Integrable Systems: From Classical to Quantum (MontrÉal, QC, 1999). CRM Proceedings & Lecture Notes &26 &251-264. Amer. Math. Soc., Providence, RI.
59. TRACY, C. A. andWIDOM, H. (2000). The distribution of the largest eigenvalue in the Gaussian ensembles. In Calogero-Moser-Sutherland Models (J. F. vanDiejen and L. Vinet, eds.). CRM Series in Mathematical Physics &4 &461-472. Springer, New York.
60. TRAN, L., VU, V. andWANG, K. (2010). Sparse random graphs: Eigenvalues and eigenvectors. Preprint. Available at http://www.math.rutgers.edu/~linhtran/.
61. WEISS, Y. (1999). Segmentation using eigenvectors: A unifying view. In Proc. of the 7th IEEE Intern. Conf. on Computer Vision, Vol. 2 975-982. IEEE Press, New York.