The number of nodal domains on quantum graphs as a stability index of graph partitions

DOI10.1007/S00220-011-1384-9zbMATH Open1244.81026arXiv1103.1423OpenAlexW2016979060MaRDI QIDQ422394FDOQ422394

Authors: R. Band, Gregory Berkolaiko, Hillel Raz, Uzy Smilansky 

Publication date: 16 May 2012

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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 $u_n$ of the $n$-th eigenfunction satisfies $nge{u}_n$. Here, we provide a new interpretation for the Courant nodal deficiency $d_n=n-u_n$ 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 $n$-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.

Full work available at URL: https://arxiv.org/abs/1103.1423

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

Mathematics Subject Classification ID

Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Cites Work

• Dynamics of nodal points and the nodal count on a family of quantum graphs
• Quantum graphs: I. Some basic structures
• Nodal domains and spectral minimal partitions
• On a class of optimal partition problems related to the Fučík spectrum and to the monotonicity formulae
• Critical partitions and nodal deficiency of billiard eigenfunctions
• An optimal partition problem for eigenvalues
• Title not available (Why is that?)
• Kirchhoff's rule for quantum wires
• Title not available (Why is that?)
• On spectral minimal partitions: a survey
• Hermitian symplectic geometry and extension theory
• Remarks on courant's nodal line theorem
• Inverse nodal problems
• Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
• Resolving isospectral ‘drums’ by counting nodal domains
• Genericity of simple eigenvalues for a metric graph
• Nodal domains on graphs - How to count them and why?
• A lower bound for nodal count on discrete and metric graphs
• Converse spectral problems for nodal domains
• Stability of nodal structures in graph eigenfunctions and its relation to the nodal domain count
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
• Counting nodal domains on surfaces of revolution
• Eigenvalue and nodal properties on quantum graph trees
• Comment on ‘Resolving isospectral ‘drums’ by counting nodal domains’
• Nodal counting on quantum graphs
• Title not available (Why is that?)
• Pleijel’s nodal domain theorem for free membranes

Cited In (34)

• On Molchanov's condition for the spectrum discreteness of a quantum graph Hamiltonian with \(\delta\)-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
• Nodal counting on quantum graphs
• Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
• Computing nodal deficiency with a refined Dirichlet-to-Neumann map
• Courant-sharp eigenvalues of Neumann 2-rep-tiles
• On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes
• Topics in elliptic problems: from semilinear equations to shape optimization
• Minimizing optimal transport for functions with fixed-size nodal sets
• On the hot spots of quantum graphs
• 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
• Morse inequalities for ordered eigenvalues of generic self-adjoint families
• Rayleigh estimates for differential operators on graphs
• 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)