Eigenvectors of random graphs: Nodal Domains

Random Structures and Algorithms

Volumn 39, Issue 1, 2011, Pages 39-58

  Dekel, Yael ^a   Lee, James R ^a,b   Linial, Nathan ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Eigenvectors; Random graphs; Spectral analysis

Indexed keywords

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

References (24)

1. N. Alon, M. Krivelevich, and V. H. Vu, On the concentration of eigenvalues of random symmetric matrices, Israel J Math 131 (2002), 259-267.
2. R. Band, I. Oren, and U. Smilansky, Nodal domains on graphs-How to count them and why? In Analysis on graphs and its applications, Proceedings of the Symptom Pure Mathematics, American Mathematics Society, Vol. 77, Providence, RI, 2008, pp. 5-27.
3. M. Berger, A panoramic view of Riemannian geometry, Springer-Verlag, Berlin, 2003.
4. I. Chavel, Eigenvalues in Riemannian geometry, Academic Press, New York, 1984.
5. R. R. Coifman, S. Lafon, A. B. Lee, M. Maggioni, B. Nadler, F. Warner, and S. Zucker, Geometric diffusion as a tool for harmonic analysis and structure definition of data. Part i: Diffusion maps, Proc Natl Acad Sci USA 102 (2005), 7426-7431.
6. R. R. Coifman, S. Lafon, A. B. Lee, M. Maggioni, B. Nadler, F. Warner, and S. Zucker, Geometric diffusion as a tool for harmonic analysis and structure definition of data. Part i: Multiscale methods, Proc Natl Acad Sci USA 102 (2005), 7432-7437.
7. K. P. Costello, T. Tao, and V. Vu, Random symmetric matrices are almost surely nonsingular, Duke Math J 135 (2006), 395-413.
8. E. B. Davies, G. M. L. Gladwell, J. Leydold, and P. F. Stadler, Discrete nodal domain theorems, Linear Algebra Appl 336 (2001), 51-60.
9. Z. Füredi and J. Komlós, The eigenvalues of random symmetric matrices, Combinatorica 1 (1981), 233-241.
10. S. Hoory, N. Linial, and A. Wigderson, Expander graphs and their applications, Bull AMS 43 (2006), 439-561.
11. M. Krivelevich and V. H. Vu, Approximating the independence number and the chromatic number in expected polynomial time, J Comb Optim 6 (2002), 143-155.
12. A. E. Litvak, A. Pajor, M. Rudelson, and N. Tomczak-Jaegermann, Smallest singular value of random matrices and geometry of random polytopes, Adv Math 195 (2005), 491-523.
13. A. E. Litvak, A. Pajor, M. Rudelson, N. Tomczak-Jaegermann, and R. Vershynin, Euclidean embeddings in spaces of finite volume ratio via random matrices, J Reine Angew Math 589 (2005), 1-19.
14. L. Lovász, Combinatorial problems and exercises, Elsevier, North Holland, NY, 1979.
15. R. Paley and A. Zygmund, A note on analytic functions in the unit circle, Proc Camb Phil Soc 28 (1932), 266-272.
16. A. Pothen, H. D. Simon, and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J Matrix Anal Appl 11 (1990), 430-452.
17. M. Rudelson, Invertibility of random matrices: Norm of the inverse, Ann Math 168 (2008), 575-600.
18. M. Rudelson and R. Vershynin, The littlewood-offord problem and invertibility of random matrices, Adv Math 218 (2008), 600-633.
19. J. Shi and J. Malik, Normalized cuts and image segmentation, IEEE Trans Pattern Anal Mach Intell 22 (2000), 888-905.
20. D. W. Stroock, Probability theory: An analytic view, Cambridge University Press, Cambridge, 1993.
21. T. Tao and V. Vu, Inverse Littlewood-Offord theorems and the condition number of random discrete matrices, Ann Math 169 (2009), 595-632.
22. T. Tao and V. Vu, Random matrices: The distribution of the smallest singular values, ArXiv e-prints (2009).
23. V. Vu, Random discrete matrices, arXiv:math/0611321 (2007).
24. Y. Weiss, Segmentation using eigenvectors: A unifying view, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 1999, pp. 520-527.