Abstract: We consider the real eigenfunctions of the Schr"odinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds . For well connected graphs, with incommensurate bond lengths, the distribution of the number of nodal domains in the interval mentioned above approaches a Gaussian distribution in the limit when the number of vertices is large. The approach to this limit is not simple, and we discuss it in detail. At the same time we define a random wave model for graphs, and compare the predictions of this model with analytic and numerical computations.
Recommendations
- Nodal statistics on quantum graphs
- Dynamics of nodal points and the nodal count on a family of quantum graphs
- The number of nodal domains on quantum graphs as a stability index of graph partitions
- Eigenvalue and nodal properties on quantum graph trees
- On Pleijel's nodal domain theorem for quantum graphs
- Nodal count of graph eigenfunctions via magnetic perturbation
- \(n\)-particle quantum statistics on graphs
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Quantum graphs and random-matrix theory
- Counting Feynman-like graphs: quasimodularity and Siegel-Veech weight
Cited in
(29)- Nodal statistics on quantum graphs
- Quantum graphs which optimize the spectral gap
- No quantum ergodicity for star graphs
- On the ground state for quantum graphs
- On Pleijel's nodal domain theorem for quantum graphs
- On fully supported eigenfunctions of quantum graphs
- Neumann domains on quantum graphs
- On the hot spots of quantum graphs
- On the nodal structure of nonlinear stationary waves on star graphs
- On the quotient quantum graph with respect to the regular representation
- A theory of spectral partitions of metric graphs
- The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Counting Open Nodal Lines of Random Waves on Planar Domains
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Nodal domains on graphs - How to count them and why?
- Eigenvalue and nodal properties on quantum graph trees
- Dynamics of nodal points and the nodal count on a family of quantum graphs
- The number of nodal domains on quantum graphs as a stability index of graph partitions
- The ergodicity landscape of quantum theories
- On the nodal count statistics for separable systems in any dimension
- Rényi and Tsallis entropies related to eigenfunctions of quantum graphs
- Minimizing optimal transport for functions with fixed-size nodal sets
- Eigenfunction statistics on quantum graphs
- Universality of Nodal Count Distribution in Large Metric Graphs
- Generic Laplacian eigenfunctions on metric graphs
- Nodal count for a random signing of a graph with disjoint cycles
- On the distribution of local extrema in quantum chaos
- A lower bound for nodal count on discrete and metric graphs
This page was built for publication: Nodal counting on quantum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5461774)
