Nodal Count for Orthogonally Invariant Ensembles

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…