Gaps between consecutive eigenvalues for compact metric graphs

DOI10.1016/J.JMAA.2023.127802MaRDI QIDQ6423659zbMATH OpenOpenAlexFDO

Authors David Borthwick, Evans M. II Harrell, Haozhe Yu

Publication date 17 January 2023

Full work available at URL https://doi.org/10.1016/j.jmaa.2023.127802

Mathematics Subject Classification ID

Ordinary differential operators (34Lxx) Elliptic equations and elliptic systems (35Jxx) General mathematical topics and methods in quantum theory (81Qxx)

Abstract: On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $lambd{a}_2-lambd{a}_1$ is established, with a constant that depends only on the total length of the graph and minimum edge length. We also prove some improvements of known upper bounds for eigenvalue gaps and ratios for metric trees and extensions to certain other types of graphs.

Recommendations

• Eigenvalue estimates for the Laplacian on a metric tree
• On the spectral gap of a quantum graph
• Impediments to diffusion in quantum graphs: Geometry-based upper bounds on the spectral gap
• Eigenvalue bracketing for discrete and metric graphs
• Extremal properties of eigenvalues for a metric graph.

Cited in

(3)

• Mean distance on metric graphs
• Optimizing the fundamental eigenvalue gap of quantum graphs
• Optimization of quantum graph eigenvalues with preferred orientation vertex conditions

This page was built for publication: Gaps between consecutive eigenvalues for compact metric graphs

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