On Pleijel's nodal domain theorem for quantum graphs

DOI10.1007/S00023-021-01077-6MaRDI QIDQ2051479zbMATH OpenOpenAlexFDO

Authors Matthias Hofmann, James Bernard Kennedy, Delio Mugnolo, M. Plümer

Publication date 24 November 2021

Published in Annales Henri Poincaré (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Graph theory (05C99) Boundary value problems on graphs and networks for ordinary differential equations (34B45) Eigenfunctions, eigenfunction expansions, completeness of eigenfunctions of ordinary differential operators (34L10) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Abstract: We establish metric graph counterparts of Pleijel's theorem on the asymptotics of the number of nodal domains $u_n$ of the $n$-th eigenfunction(s) of a broad class of operators on compact metric graphs, including Schr"odinger operators with $L^1$-potentials and a variety of vertex conditions as well as the $p$-Laplacian with natural vertex conditions, and without any assumptions on the lengths of the edges, the topology of the graph, or the behaviour of the eigenfunctions at the vertices. {Among other things, these results characterise the accumulation points of the sequence $(frac{u}_{n}n{)}_{ninmathbbN}$, which are shown always to form a finite subset of $(0,1]$. This} extends the previously known result that $u_{n}simn$ extit{generically}, for certain realisations of the Laplacian, in several directions. In particular, in the special cases of the Laplacian with natural conditions, we show that for graphs with rationally dependent edge lengths, one can find eigenfunctions thereon for which $u_{n}otsimn$; but in this case even the set of points of accumulation may depend on the choice of eigenbasis.

Recommendations

• The number of nodal domains on quantum graphs as a stability index of graph partitions
• Nodal counting on quantum graphs
• A Frucht theorem for quantum graphs
• Nodal statistics on quantum graphs
• Dynamics of nodal points and the nodal count on a family of quantum graphs
• Eigenvalue and nodal properties on quantum graph trees
• On the Weyl law for quantum graphs
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
• Neumann domains on quantum graphs
• Index theorems for quantum graphs

Cites work

• A characteristic equation associated to an eigenvalue problem on c^ 2-networks
• A lower bound for nodal count on discrete and metric graphs
• A theory of spectral partitions of metric graphs
• Courant's nodal domain theorem for positivity preserving forms
• Discrete nodal domain theorems
• Edge connectivity and the spectral gap of combinatorial and quantum graphs
• Eigenvalues, embeddings and generalised trigonometric functions
• Gaussian estimates for a heat equation on a network
• scientific article; zbMATH DE number 3966733 (Why is no real title available?)
• scientific article; zbMATH DE number 4050157 (Why is no real title available?)
• scientific article; zbMATH DE number 2247495 (Why is no real title available?)
• Introduction to quantum graphs
• Nodal counting on quantum graphs
• Nodal decompositions of graphs
• Nodal statistics on quantum graphs
• Nonlinear Markov semigroups, nonlinear Dirichlet forms and applications to minimal surfaces
• On Courant's nodal domain theorem
• On extremal eigenvalues of the graph Laplacian ^*
• On the generalization of the Courant nodal domain theorem
• On the ground state for quantum graphs
• On the spectral gap of a quantum graph
• Oscillation properties of the spectrum of a boundary value problem on a graph
• Positive eigenfunctions for the p-Laplace operator revisited
• Remarks on courant's nodal line theorem
• Resonance problems for the p-Laplacian
• Schrödinger operators on graphs: symmetrization and Eulerian cycles
• Semigroup methods for evolution equations on networks
• Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
• Stability of eigenvalues of quantum graphs with respect to magnetic perturbation and the nodal count of the eigenfunctions
• Sturm--Liouville theory for the p-Laplacian
• Sturm-Liouville type problems for the \(p\)-Laplacian under asymptotic non-resonance conditions
• Surgery principles for the spectral analysis of quantum graphs
• The first eigenvalue of the p-Laplacian on quantum graphs
• The nodal count \(\{0,1,2,3,\ldots\}\) implies the graph is a tree
• The number of nodal domains on quantum graphs as a stability index of graph partitions
• Topological resonances on quantum graphs
• Variational and non-variational eigenvalues of the \(p\)-Laplacian

Cited in

(14)

• On fully supported eigenfunctions of quantum graphs
• Neumann domains on quantum graphs
• Zero modes of quantum graph Laplacians and an index theorem
• Doubly nonlinear Schrödinger ground states on metric graphs
• Nodal counting on quantum graphs
• Minimizing optimal transport for functions with fixed-size nodal sets
• Ground states for the NLS equation with combined local nonlinearities on noncompact metric graphs
• Spectral minimal partitions of unbounded metric graphs
• Universality of Nodal Count Distribution in Large Metric Graphs
• Generic Laplacian eigenfunctions on metric graphs
• Spectral theory for Schrödinger operators on compact metric graphs with and ' couplings: a survey
• Geometric spectral theory of quantum graphs
• Dynamical processes on metric networks
• Local minimizers for the NLS equation with localized nonlinearity on noncompact metric graphs

This page was built for publication: On Pleijel's nodal domain theorem for quantum graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051479)