Eigenvalue estimates for the Laplacian on a metric tree
From MaRDI portal
Publication:2964042
Abstract: We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular, we establish a sharp upper bound for the spectral gap, i.e. the smallest positive eigenvalue, and show that equilateral star graphs are the unique maximizers of the spectral gap among all trees of a given average length.
Recommendations
- Eigenvalue estimates for the Laplacian with anti-Kirchhoff conditions on a metric tree
- Eigenvalue Estimates for the Weighted Laplacian on Metric Trees
- Extremal properties of eigenvalues for a metric graph.
- A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
- Eigenvalue estimates for Schrödinger operators on metric trees
Cites work
- scientific article; zbMATH DE number 4050157 (Why is no real title available?)
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
- Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
- Eigenvalue Estimates for the Weighted Laplacian on Metric Trees
- Eigenvalue bracketing for discrete and metric graphs
- Eigenvalue estimates for Schrödinger operators on metric trees
- Extremal properties of eigenvalues for a metric graph.
- Introduction to quantum graphs
- On an inequality between Dirichlet and Neumann eigenvalues for the Laplace operator
- On semiclassical and universal inequalities for eigenvalues of quantum graphs
- On the ground state of quantum graphs with attractive -coupling
- On the spectral gap of a quantum graph
- Rayleigh estimates for differential operators on graphs
- Schrödinger operators on graphs: symmetrization and Eulerian cycles
- Some inequalities between Dirichlet and Neumann eigenvalues
- Spectral gap for complete graphs: upper and lower estimates
- Spectral gap for quantum graphs and their edge connectivity
- Spectral inequalities for quantum graphs
Cited in
(38)- Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Eigenvalue estimates for the Laplacian with anti-Kirchhoff conditions on a metric tree
- Eigenvalue bracketing for discrete and metric graphs
- On extremal eigenvalues of the graph Laplacian *
- Lower estimates on eigenvalues of quantum graphs
- Spectral gap for complete graphs: upper and lower estimates
- On the hot spots of quantum graphs
- Quantum graphs which optimize the spectral gap
- Spectral monotonicity for Schrödinger operators on metric graphs
- scientific article; zbMATH DE number 4050157 (Why is no real title available?)
- Quantum trees which maximize higher eigenvalues are unbalanced
- Upper bounds for the Steklov eigenvalues on trees
- Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
- Optimizing the fundamental eigenvalue gap of quantum graphs
- scientific article; zbMATH DE number 3979631 (Why is no real title available?)
- Gaps between consecutive eigenvalues for compact metric graphs
- On the spectrum of the Laplacian on regular metric trees
- Surgery transformations and spectral estimates of \(\delta\) beam operators
- Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
- Surgery principles for the spectral analysis of quantum graphs
- Eigenvalue Estimates for the Weighted Laplacian on Metric Trees
- scientific article; zbMATH DE number 1064794 (Why is no real title available?)
- Some remarks on the eigenvalue multiplicities of the Laplacian on infinite locally finite trees
- Laplacians on bipartite metric graphs
- Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
- A Faber-Krahn-type inequality for regular trees
- scientific article; zbMATH DE number 2052578 (Why is no real title available?)
- Limits of quantum graph operators with shrinking edges
- Gluing graphs and the spectral gap: a Titchmarsh–Weyl matrix-valued function approach
- Eigenvalue estimates for Schrödinger operators on metric trees
- Upper bound for the diameter of a tree in the quantum graph theory
- Spectral estimates for infinite quantum graphs
- A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
- The Krein-von Neumann extension for Schrödinger operators on metric graphs
- Positive Eigenfunctions of the Laplacian and Conformal Densities on Homogeneous Trees
- Mini-workshop: A geometric fairytale full of spectral gaps and random fruit. Abstracts from the mini-workshop held November 27 -- December 3, 2022
- Heat kernels of metric trees and applications
This page was built for publication: Eigenvalue estimates for the Laplacian on a metric tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2964042)