Eigenvalue estimates for the Laplacian on a metric tree

DOI10.1090/PROC/13403zbMATH Open1367.34029arXiv1602.03864OpenAlexW2963011692MaRDI QIDQ2964042FDOQ2964042

Authors: Jonathan Rohleder 

Publication date: 22 February 2017

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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.

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

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

zbMATH Keywords

treesLaplacianspectral gap

Mathematics Subject Classification ID

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) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10)

Cites Work

• Introduction to quantum graphs
• Extremal properties of eigenvalues for a metric graph.
• Spectral gap for quantum graphs and their edge connectivity
• On the ground state of quantum graphs with attractive \(\delta \)-coupling
• On the spectral gap of a quantum graph
• Title not available (Why is that?)
• Rayleigh estimates for differential operators on graphs
• Dependence of the spectrum of a quantum graph on vertex conditions and edge lengths
• Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs
• Some inequalities between Dirichlet and Neumann eigenvalues
• Eigenvalue Estimates for the Weighted Laplacian on Metric Trees
• Eigenvalue bracketing for discrete and metric graphs
• On an inequality between Dirichlet and Neumann eigenvalues for the Laplace operator
• On semiclassical and universal inequalities for eigenvalues of quantum graphs
• Eigenvalue estimates for Schrödinger operators on metric trees
• Spectral inequalities for quantum graphs
• Schrödinger operators on graphs: symmetrization and Eulerian cycles
• Spectral gap for complete graphs: upper and lower estimates

Cited In (38)

• Edge connectivity and the spectral gap of combinatorial and quantum graphs
• On extremal eigenvalues of the graph Laplacian ^*
• Eigenvalue estimates for the Laplacian with anti-Kirchhoff conditions on a metric tree
• Eigenvalue bracketing for discrete and metric graphs
• 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
• Quantum trees which maximize higher eigenvalues are unbalanced
• Title not available (Why is that?)
• Optimizing the fundamental eigenvalue gap of quantum graphs
• Upper bounds for the Steklov eigenvalues on trees
• Upper eigenvalue bounds for the Kirchhoff Laplacian on embedded metric graphs
• Gaps between consecutive eigenvalues for compact metric graphs
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Spectral theory for Schrödinger operators on compact metric graphs with \(\delta\) and \(\delta '\) couplings: a survey
• Laplacians on bipartite metric graphs
• Some remarks on the eigenvalue multiplicities of the Laplacian on infinite locally finite trees
• A Faber-Krahn-type inequality for regular trees
• Title not available (Why is that?)
• Limits of quantum graph operators with shrinking edges
• Gluing graphs and the spectral gap: a Titchmarsh–Weyl matrix-valued function approach
• Upper bound for the diameter of a tree in the quantum graph theory
• Eigenvalue estimates for Schrödinger operators on metric trees
• A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
• Spectral estimates for infinite 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
• Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap

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)