A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
From MaRDI portal
Publication:5126341
DOI10.1007/978-3-030-44097-8_11zbMATH Open1473.81070arXiv1807.08185OpenAlexW2979287585MaRDI QIDQ5126341FDOQ5126341
Author name not available (Why is that?)
Publication date: 16 October 2020
Published in: Discrete and Continuous Models in the Theory of Networks (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1807.08185
Estimates of eigenvalues in context of PDEs (35P15) 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) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Cites Work
- Semigroup methods for evolution equations on networks
- The number of nodal domains on quantum graphs as a stability index of graph partitions
- Title not available (Why is that?)
- Dynamic and generalized Wentzell node conditions for network equations
- NLS ground states on graphs
- Extremal properties of eigenvalues for a metric graph.
- Lack of Ground State for NLSE on Bridge-Type Graphs
- Extremizing algebraic connectivity subject to graph theoretic constraints
- Isoperimetric Inequalities and Their Applications
- Semi-classical measures on quantum graphs and the Gauß map of the determinant manifold
- Spectral gap for quantum graphs and their edge connectivity
- Eigenvalues, diameter, and mean distance in graphs
- The Laplacian with Wentzell-Robin boundary conditions on spaces of continuous functions
- On the spectral gap of a quantum graph
- Title not available (Why is that?)
- Rayleigh estimates for differential operators on graphs
- The first eigenvalue of the \(p-\)Laplacian on quantum graphs
- Genericity of simple eigenvalues for a metric graph
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- A lower bound for nodal count on discrete and metric graphs
- Eigenvalue estimates for the Laplacian on a metric tree
- Minimization problems for eigenvalues of the Laplacian.
- Pucci eigenvalues on geodesic balls
- 10 Nodal and spectral minimal partitions – The state of the art in 2016 –
- Negative energy ground states for the \(L^{2}\)-critical NLSE on metric graphs
- Existence of infinitely many stationary solutions of the \(L^{2}\)-subcritical and critical NLSE on compact metric graphs
- Shape optimization and spectral theory
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Quantum graphs which optimize the spectral gap
- Surgery principles for the spectral analysis of quantum graphs
Cited In (7)
- The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
- Competing nonlinearities in NLS equations as source of threshold phenomena on star graphs
- Quantum trees which maximize higher eigenvalues are unbalanced
- Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
- Concrete method for recovering the Euler characteristic of quantum graphs
- Upper bound for the diameter of a tree in the quantum graph theory
- Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap
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 👍 👎
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)
