Nodal Count for Orthogonally Invariant Ensembles
Preprint
Abstract
We investigate the nodal count of eigenvectors of random matrices interpreted as operators on signed complete graphs. Our focus is on orthogonally invariant ensembles, with particular attention to the Gaussian Orthogonal Ensemble (GOE). We establish that, as the matrix size tends to infinity, the distribution of nodal counts converges to the same limiting law as the eigenvalue distribution. In the GOE case, this limit is the semicircle law. This result refutes a conjecture, motivated by quantum chaos and quantum graphs, which predicted Gaussian behavior of the nodal count.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Universality of Nodal Count Distribution in Large Metric GraphsExperimental Mathematics, 2022
- Fluctuations in the number of nodal domainsJournal of Mathematical Physics, 2020
- Nodal Statistics of Planar Random WavesCommunications in Mathematical Physics, 2019
- Non-Universality of Nodal Length Distribution for Arithmetic Random WavesGeometric and Functional Analysis, 2016
- Magnetic interpretation of the nodal defect on graphsAnalysis & PDE, 2013
- Nodal count of graph eigenfunctions via magnetic perturbationAnalysis & PDE, 2013
- On the number of nodal domains of random spherical harmonicsAmerican Journal of Mathematics, 2009
- A Lower Bound for Nodal Count on Discrete and Metric GraphsCommunications in Mathematical Physics, 2007
- Gaussian Hilbert Spaces1997
- Eigenvectors of acyclic matricesCzechoslovak Mathematical Journal, 1975