A lower bound for nodal count on discrete and metric graphs
From MaRDI portal
Publication:956633
DOI10.1007/S00220-007-0391-3zbMATH Open1171.05356arXivmath-ph/0611026OpenAlexW3098936281MaRDI QIDQ956633FDOQ956633
Authors: Gregory Berkolaiko 
Publication date: 25 November 2008
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Abstract: According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes: N-th eigenfunction cannot have more than N domains. He also gave an example of a eigenfunction high in the spectrum with a minimal number of nodal domains, thus excluding the existence of a non-trivial lower bound. An analogue of Sturm's result for discretizations of the interval was discussed by Gantmacher and Krein. The discretization of an interval is a graph of a simple form, a chain-graph. But what can be said about more complicated graphs? It has been known since the early 90s that the nodal count for a generic eigenfunction of the Schrodinger operator on quantum trees (where each edge is identified with an interval of the real line and some matching conditions are enforced on the vertices) is exact too: zeros of the N-th eigenfunction divide the tree into exactly N subtrees. We discuss two extensions of this result in two directions. One deals with the same continuous Schrodinger operator but on general graphs (i.e. non-trees) and another deals with discrete Schrodinger operator on combinatorial graphs (both trees and non-trees). The result that we derive applies to both types of graphs: the number of nodal domains of the N-th eigenfunction is bounded below by N-L, where L is the number of links that distinguish the graph from a tree (defined as the dimension of the cycle space or the rank of the fundamental group of the graph). We also show that if it the genericity condition is dropped, the nodal count can fall arbitrarily far below the number of the corresponding eigenfunction.
Full work available at URL: https://arxiv.org/abs/math-ph/0611026
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Linear difference operators (47B39)
Cites Work
- Periodic orbit theory and spectral statistics for quantum graphs
- Title not available (Why is that?)
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Discrete nodal domain theorems
- The qualitative Sturm-Liouville theory on spatial networks
- Remarks on courant's nodal line theorem
- Eigenvectors of acyclic matrices
- Title not available (Why is that?)
- Graph models for waves in thin structures
- Resolving isospectral ‘drums’ by counting nodal domains
- Genericity of simple eigenvalues for a metric graph
- Title not available (Why is that?)
- A discrete nodal domain theorem for trees
- Some geometric aspects of graphs and their eigenfunctions
- Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
- Eigenvalue and nodal properties on quantum graph trees
- Nodal counting on quantum graphs
Cited In (37)
- Nodal count of graph eigenfunctions via magnetic perturbation
- Nodal geometry of graphs on surfaces
- 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
- Universality of Nodal Count Distribution in Large Metric Graphs
- Generic Laplacian eigenfunctions on metric graphs
- Spectral minimal partitions of unbounded metric graphs
- Nodal domain theorems for \(p\)-Laplacians on signed graphs
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Nodal domains on graphs - How to count them and why?
- Torsional rigidity, isospectrality and quantum graphs
- Nodal domain count and vertex bipartiteness.
- A theory of spectral partitions of metric graphs
- Quantum graphs which optimize the spectral gap
- On the nodal structure of nonlinear stationary waves on star graphs
- Graphs and their real eigenvectors
- Nodal decompositions of graphs
- A natural lower bound for the size of nodal sets
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Nonlinear Sturm oscillation: From the interval to a star
- Eigenvalue and nodal properties on quantum graph trees
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- An elementary introduction to quantum graphs
- Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
- Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
- On Pleijel's nodal domain theorem for quantum graphs
- Morse theory for discrete magnetic operators and nodal count distribution for graphs
- Nodal statistics on quantum graphs
- Surgery principles for the spectral analysis of quantum graphs
- Neumann domains on quantum graphs
- Nodal domain counts and the chromatic number of graphs
- On fully supported eigenfunctions of quantum graphs
- Nodal domain count for the generalized graph \(p\)-Laplacian
- Many nodal domains in random regular graphs
- The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
- A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
- Symmetric matrices, signed graphs, and nodal domain theorems
This page was built for publication: A lower bound for nodal count on discrete and metric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q956633)
