Eigenvectors of Random Graphs: Nodal Domains

Authors:
Yael Dekel;James R. Lee;Nathan Linial
Affiliations:
Hebrew University,;University of Washington,;Hebrew University,
Venue:
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
Year:
2007

Citing 2
Cited 1

Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence

Sparse random graphs: Eigenvalues and eigenvectors

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We initiate a systematic study of eigenvectors of random graphs. Whereas much is known about eigenvalues of graphs and how they reflect properties of the underlying graph, relatively little is known about the corresponding eigenvectors. Our main focus in this paper is on the nodal domainsassociated with the different eigenfunctions. In the analogous realm of Laplacians of Riemannian manifolds, nodal domains have been the subject of intensive research for well over a hundred years. Graphical nodal domains turn out to have interesting and unexpected properties. Our main theorem asserts that there is a constant csuch that for almost every graph G, each eigenfunction of Ghas at most 2 nodal domains, together with at most cexceptional vertices falling outside these primary domains. We also discuss variations of these questions and briefly report on some numerical experiments which, in particular, suggest that there are almost surely no exceptional vertices.