Eigenvectors of Random Graphs: Nodal Domains

DOI10.1007/978-3-540-74208-1_32zbMATH Open1171.05418OpenAlexW2790656432MaRDI QIDQ3603485FDOQ3603485

Authors: Yael Dekel, James R. Lee, 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

Recommendations

• Eigenvectors of random graphs: nodal domains
• Many nodal domains in random regular graphs
• Size of nodal domains of the eigenvectors of a \(G(n,p)\) graph
• Nodal domains of eigenvectors for 1-Laplacian on graphs
• Graph Laplacians, nodal domains, and hyperplane arrangements

Mathematics Subject Classification ID

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

Cited In (11)

• Eigenvectors of random graphs: nodal domains
• The necessity of conditions for graph quantum ergodicity and Cartesian products with an infinite graph
• Graphs and their real eigenvectors
• Isospectral discrete and quantum graphs with the same flip counts and nodal counts
• Size of nodal domains of the eigenvectors of a \(G(n,p)\) graph
• Graph Laplacians, nodal domains, and hyperplane arrangements
• Sparse random graphs: eigenvalues and eigenvectors
• Eigenvectors of the discrete Laplacian on regular graphs—a statistical approach
• Spectral experiments+
• Many nodal domains in random regular graphs
• Nodal domains of eigenvectors for 1-Laplacian on graphs

This page was built for publication: Eigenvectors of Random Graphs: Nodal Domains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603485)