Quantum graphs -- Generic eigenfunctions and their nodal count and Neumann count statistics
arXiv:2010.03004
Abstract
In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex conditions. The first goal of this thesis is the study of the nodal count problem. That is the number of points on which the th eigenfunction vanishes. We provide a probabilistic setting using which we are able to define the nodal count\textquoteright s statistics. We show that the nodal count statistics admit a topological symmetry by which the first Betti number of the graph can be obtained. We revise a conjecture that predicts a universal Gaussian behavior of the nodal count statistics for large graphs and we prove it for a certain family of graphs. The second goal is to formulate and study the Neumann count, which is the number of local extrema of the th eigenfunction. This counting problem is motivated by the Neumann partitions of planar domains, a novel concept in spectral geometry. We provide uniform bounds on the Neumann count and investigate its statistics. We show that the Neumann count provides complimentary geometrical information to that obtained from the nodal count. We show that for a certain family of growing tree graphs the Neumann count statistics approaches a Gaussian distribution. The third goal is a genericity result, which justifies the generality of the Neumann count discussion. To this day it was known that generically, eigenfunctions do not vanish on vertices. We generalize this result to derivatives at vertices as well. That is, generically, the derivatives of an eigenfunction on interior vertices do not vanish.
References in corpus (21)
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Can One Hear the Shape of a Graph?
- Nodal domains statistics - a criterion for quantum chaos
- Percolation model for nodal domains of chaotic wave functions
- On the level spacing distribution in quantum graphs
- Quantum graphs: an introduction and a brief survey
- The Isospectral Fruits of Representation Theory: Quantum Graphs and Drums
- Limits of Quantum Graph Operators With Shrinking Edges
- Convergence of resonances on thin branched quantum wave guides
- Nodal domains on quantum graphs
- On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions
- Spectral correlations of individual quantum graphs
- Exact Elliptic Compactons in Generalized Korteweg-DeVries Equations
- Can one count the shape of a drum?
- Survey of the inverse spectral problem
- Universality of the momentum band density of periodic networks
- Critical partitions and nodal deficiency of billiard eigenfunctions
- Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
- Isospectral graphs with identical nodal counts
- Trace Formulae for quantum graphs with edge potentials
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts