A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
From MaRDI portal
Boundary value problems on graphs and networks for ordinary differential equations (34B45) Eigenvalues, estimation of eigenvalues, upper and lower bounds of ordinary differential operators (34L15) Estimates of eigenvalues in context of PDEs (35P15) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Abstract: We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph. This extends a result of, and resolves an open problem from, [J. B. Kennedy, P. Kurasov, G. Malenov'a and D. Mugnolo, Ann. Henri Poincar'e 17 (2016), 2439--2473, Section 7.2], and also complements an analogous lower bound for the corresponding eigenvalue of the combinatorial Laplacian on a discrete graph. We also give a family of corresponding lower bounds for the higher eigenvalues under the assumption that the total length of the graph is sufficiently large compared with its diameter. These inequalities are sharp in the case of trees.
Recommendations
- Sharp diameter bound on the spectral gap for quantum graphs
- Lower estimates on eigenvalues of quantum graphs
- Spectral inequalities for quantum graphs
- On semiclassical and universal inequalities for eigenvalues of quantum graphs
- Upper bound for the diameter of a tree in the quantum graph theory
- On the spectral gap of a quantum graph
- On the essential spectrum of quantum graphs
- Spectral asymptotics for quantum graphs with equal edge lengths
- Eigenvalues and the diameter of graphs
- Spectral bounds for the quantum chromatic number of quantum graphs
Cites work
- A lower bound for nodal count on discrete and metric graphs
- Dynamic and generalized Wentzell node conditions for network equations
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Eigenvalue estimates for the Laplacian on a metric tree
- Eigenvalues, diameter, and mean distance in graphs
- Existence of infinitely many stationary solutions of the \(L^{2}\)-subcritical and critical NLSE on compact metric graphs
- Extremal properties of eigenvalues for a metric graph.
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Genericity of simple eigenvalues for a metric graph
- scientific article; zbMATH DE number 4050157 (Why is no real title available?)
- Introduction to quantum graphs
- Isoperimetric Inequalities and Their Applications
- Lack of ground state for NLSE on bridge-type graphs
- Minimization problems for eigenvalues of the Laplacian.
- Negative energy ground states for the \(L^{2}\)-critical NLSE on metric graphs
- NLS ground states on graphs
- Nodal and spectral minimal partitions -- The state of the art in 2016
- On the spectral gap of a quantum graph
- Pucci eigenvalues on geodesic balls
- Quantum graphs which optimize the spectral gap
- Rayleigh estimates for differential operators on graphs
- Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
- Semigroup methods for evolution equations on networks
- Shape optimization and spectral theory
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- Spectral gap for quantum graphs and their edge connectivity
- Surgery principles for the spectral analysis of quantum graphs
- The first eigenvalue of the p-Laplacian on quantum graphs
- The Laplacian with Wentzell-Robin boundary conditions on spaces of continuous functions
- The number of nodal domains on quantum graphs as a stability index of graph partitions
Cited in
(19)- On torsional rigidity and ground-state energy of compact quantum graphs
- Competing nonlinearities in NLS equations as source of threshold phenomena on star graphs
- An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
- On the hot spots of quantum graphs
- Upper bound for the diameter of a tree in the quantum graph theory
- Eigenvalue estimates for the Laplacian on a metric tree
- On the spectral gap of a quantum graph
- On semiclassical and universal inequalities for eigenvalues of quantum graphs
- Diameters, distortion, and eigenvalues
- The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
- Sharp diameter bound on the spectral gap for quantum graphs
- The first eigenvalue of the p-Laplacian on quantum graphs
- Concrete method for recovering the Euler characteristic of quantum graphs
- Quantum trees which maximize higher eigenvalues are unbalanced
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap
- Spectral theory for Schrödinger operators on compact metric graphs with and ' couplings: a survey
- Geometric spectral theory of quantum graphs
- Optimization of quantum graph eigenvalues with preferred orientation vertex conditions
This page was built for publication: A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5126341)
