Size of nodal domains of the eigenvectors of a graph

DOI10.1002/rsa.20925zbMath1453.05060arXiv1905.00447OpenAlexW3016634990MaRDI QIDQ5136920

Han Huang, M. V. Rudel'son

Publication date: 30 November 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.00447

zbMATH Keywords

random matricesnodal domainsErdős-Renyi graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Random matrices (algebraic aspects) (15B52)

Related Items (5)

The necessity of conditions for graph quantum ergodicity and Cartesian products with an infinite graph ⋮ Noise sensitivity for the top eigenvector of a sparse random matrix ⋮ Many nodal domains in random regular graphs ⋮ Recent progress in combinatorial random matrix theory ⋮ Tail bounds for gaps between eigenvalues of sparse random matrices

This page was built for publication: Size of nodal domains of the eigenvectors of a graph