Universality of Nodal Count Distribution in Large Metric Graphs
Authors:
- 4 July 2022
- journal article
- research article
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 33 (2) , 301-335
Abstract
An eigenfunction of the Laplacian on a metric (quantum) graph has an excess number of zeros due to the graph’s non-trivial topology. This number, called the nodal surplus, is an integer between 0 and the graph’s first Betti number β. We study the distribution of the nodal surplus values in the countably infinite set of the graph’s eigenfunctions. We conjecture that this distribution converges to Gaussian for any sequence of graphs of growing β. We prove this conjecture for several special graph sequences and test it numerically for a variety of well-known graph families. Accurate computation of the distribution is made possible by a formula expressing the nodal surplus distribution as an integral over a high-dimensional torus.Keywords
All Related Versions
Funding Information
- NSF
- Binational Science Foundation (2016281)
- ISF (844/19)
- National Science Foundation (DMS-1815075)
This publication has 42 references indexed in Scilit:
- On the number of nodal domains of random spherical harmonicsAmerican Journal of Mathematics, 2009
- Pleijel’s nodal domain theorem for free membranesProceedings of the American Mathematical Society, 2008
- Spectral correlations of individual quantum graphsPhysical Review E, 2005
- Nodal counting on quantum graphsWaves in Random Media, 2004
- Percolation Model for Nodal Domains of Chaotic Wave FunctionsPhysical Review Letters, 2002
- Nodal Domains Statistics: A Criterion for Quantum ChaosPhysical Review Letters, 2002
- Unitary-stochastic matrix ensembles and spectral statisticsJournal of Physics A: General Physics, 2001
- Quantum Chaos on GraphsPhysical Review Letters, 1997
- Geodesics in homology classesDuke Mathematical Journal, 1987
- Remarks on courant's nodal line theoremCommunications on Pure and Applied Mathematics, 1956