arXiv · 2301.07149
Gaps between consecutive eigenvalues for compact metric graphs
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 $\lambda_2 - \lambda_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.
Explore related subjects
Keep this discovery
David Borthwick, Evans M. Harrell II, Haozhe Yu. 2023-01-17. Gaps between consecutive eigenvalues for compact metric graphs. https://arxiv.org/abs/2301.07149
Cite the original work for its findings. Save a collection to share your selection of sources.