The number of nodal domains on quantum graphs as a stability index of graph partitions
From MaRDI portal
(Redirected from Publication:422394)
Abstract: Courant theorem provides an upper bound for the number of nodal domains of eigenfunctions of a wide class of Laplacian-type operators. In particular, it holds for generic eigenfunctions of quantum graph. The theorem stipulates that, after ordering the eigenvalues as a non decreasing sequence, the number of nodal domains of the -th eigenfunction satisfies . Here, we provide a new interpretation for the Courant nodal deficiency in the case of quantum graphs. It equals the Morse index --- at a critical point --- of an energy functional on a suitably defined space of graph partitions. Thus, the nodal deficiency assumes a previously unknown and profound meaning --- it is the number of unstable directions in the vicinity of the critical point corresponding to the -th eigenfunction. To demonstrate this connection, the space of graph partitions and the energy functional are defined and the corresponding critical partitions are studied in detail.
Recommendations
- Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
- Critical partitions and nodal deficiency of billiard eigenfunctions
- Nodal decompositions of graphs
- A lower bound for nodal count on discrete and metric graphs
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
Cites work
- scientific article; zbMATH DE number 1239739 (Why is no real title available?)
- scientific article; zbMATH DE number 2247495 (Why is no real title available?)
- scientific article; zbMATH DE number 3081828 (Why is no real title available?)
- A lower bound for nodal count on discrete and metric graphs
- An optimal partition problem for eigenvalues
- Comment on ‘Resolving isospectral ‘drums’ by counting nodal domains’
- Converse spectral problems for nodal domains
- Counting nodal domains on surfaces of revolution
- Critical partitions and nodal deficiency of billiard eigenfunctions
- Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
- Dynamics of nodal points and the nodal count on a family of quantum graphs
- Eigenvalue and nodal properties on quantum graph trees
- Genericity of simple eigenvalues for a metric graph
- Hermitian symplectic geometry and extension theory
- Inverse nodal problems
- Kirchhoff's rule for quantum wires
- Nodal counting on quantum graphs
- Nodal domains and spectral minimal partitions
- Nodal domains on graphs - How to count them and why?
- Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
- On a class of optimal partition problems related to the Fučík spectrum and to the monotonicity formulae
- On spectral minimal partitions: a survey
- Pleijel’s nodal domain theorem for free membranes
- Quantum graphs: I. Some basic structures
- Remarks on courant's nodal line theorem
- Resolving isospectral ‘drums’ by counting nodal domains
- Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
Cited in
(34)- On Molchanov's condition for the spectrum discreteness of a quantum graph Hamiltonian with -coupling
- Magnetic interpretation of the nodal defect on graphs
- Extremality conditions and regularity of solutions to optimal partition problems involving Laplacian eigenvalues
- Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
- Spectral minimal partitions of unbounded metric graphs
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Nodal counting on quantum graphs
- Computing nodal deficiency with a refined Dirichlet-to-Neumann map
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
- Courant-sharp eigenvalues of Neumann 2-rep-tiles
- Topics in elliptic problems: from semilinear equations to shape optimization
- On the hot spots of quantum graphs
- Minimizing optimal transport for functions with fixed-size nodal sets
- A theory of spectral partitions of metric graphs
- On the nodal structure of nonlinear stationary waves on star graphs
- Asymptotics and estimates for spectral minimal partitions of metric graphs
- Nodal decompositions of graphs
- Critical partitions and nodal deficiency of billiard eigenfunctions
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts
- Rayleigh estimates for differential operators on graphs
- Morse inequalities for ordered eigenvalues of generic self-adjoint families
- Regularity of all minimizers of a class of spectral partition problems
- Pleijel nodal domain theorem in non-smooth setting
- 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
- On the ground state for quantum graphs
- Surgery principles for the spectral analysis of quantum graphs
- Neumann domains on quantum graphs
- Stability of spectral partitions and the Dirichlet-to-Neumann map
- Concrete method for recovering the Euler characteristic of quantum 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
- On a magnetic characterization of spectral minimal partitions
This page was built for publication: The number of nodal domains on quantum graphs as a stability index of graph partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q422394)
