Universality of nodal count distribution in large metric graphs
Preprint
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 $\beta$. 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 $\beta$. 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
This publication has 31 references indexed in Scilit:
- Generic Laplacian eigenfunctions on metric graphsJournal d'Analyse Mathématique, 2023
- On Pleijel’s Nodal Domain Theorem for Quantum GraphsAnnales Henri Poincare, 2021
- On the number of excursion sets of planar Gaussian fieldsProbability Theory and Related Fields, 2020
- Lyndon word decompositions and pseudo orbits on q-nary graphsJournal of Mathematical Analysis and Applications, 2019
- Nodal Statistics on Quantum GraphsCommunications in Mathematical Physics, 2018
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graphJournal of Mathematical Analysis and Applications, 2017
- Dynamics of Nodal Points and the Nodal Count on a Family of Quantum GraphsAnnales Henri Poincare, 2011
- A Lower Bound for Nodal Count on Discrete and Metric GraphsCommunications in Mathematical Physics, 2007
- No Quantum Ergodicity for Star GraphsCommunications in Mathematical Physics, 2004
- Remarks on courant's nodal line theoremCommunications on Pure and Applied Mathematics, 1956