Eigenvectors of Random Graphs: Nodal Domains

DOI10.1007/978-3-540-74208-1_32zbMath1171.05418OpenAlexW2790656432MaRDI QIDQ3603485

James R. Lee, Yael Dekel, Nathan Linial

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_32

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

The necessity of conditions for graph quantum ergodicity and Cartesian products with an infinite graph ⋮ Isospectral discrete and quantum graphs with the same flip counts and nodal counts ⋮ Sparse random graphs: Eigenvalues and eigenvectors