Nodal Count for Orthogonally Invariant Ensembles
Lior Alon, Dan Mikulincer, John Urschel
TL;DR
This work analyzes the nodal count $\phi(A,k)$ of eigenvectors for random real symmetric matrices drawn from orthogonally invariant ensembles, with emphasis on GOE. By expressing $\phi(A,k)$ through sign correlations of quadratic forms on the orthogonal group and reducing to Gaussian space, the authors derive precise asymptotics: $\mathbb{E}_{\Phi,\bm{\Lambda}}[\phi(A,k)] = {n\choose 2}\left( \tfrac{1}{2} + \tfrac{2^{3/2}}{\pi^{3/2}} \mathbb{E}_{\bm{\Lambda}}[\lambda_k] n^{-1/2} + \tilde{O}(n^{-3/2}) \right)$ and $\mathrm{Var}(\phi(A,k)) = \tilde{O}(n^{5/2})$, uniformly in $k$. Under normalization to center the eigenvalues, the normalized nodal count distribution converges to the eigenvalue distribution of the ensemble; in the GOE case this limit is the semicircle law. Consequently, the long-standing Gaussian-nodality conjecture is refuted. The paper also develops a general machinery for transferring nodal statistics to eigenvalue statistics and demonstrates the non-universality of nodal fluctuations, highlighting subtle correlations that defy a universal Gaussian description.
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.
