On the Spectral Gap of a Quantum Graph
arXiv:1504.01962 · doi:10.1007/s00023-016-0460-2
Abstract
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and combinatorial properties of the graph: its total length, diameter, number of vertices and number of edges. We investigate which combinations of parameters are necessary to obtain non-trivial upper and lower bounds and obtain a number of sharp estimates in terms of these parameters. We also show that, in contrast to the Laplacian matrix on a combinatorial graph, no bound depending only on the diameter is possible. As a special case of our results on metric graphs, we deduce estimates for the normalised Laplacian matrix on combinatorial graphs which, surprisingly, are sometimes sharper than the ones obtained by purely combinatorial methods in the graph theoretical literature.
Cited by in corpus (23)
- Limits of Quantum Graph Operators With Shrinking Edges
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Quantum graphs which optimize the spectral gap
- Bi-Laplacians on graphs and networks
- Competing nonlinearities in NLS equations as source of threshold phenomena on star graphs
- Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs
- Nodal Statistics On Quantum Graphs
- Spectral Estimates for Infinite Quantum Graphs
- Schrödinger and polyharmonic operators on infinite graphs: Parabolic well-posedness and p-independence of spectra
- An elementary introduction to quantum graphs
- On Pleijel's nodal domain theorem for quantum graphs
- Quantum Graphs: -symmetry and reflection symmetry of the spectrum
- The Cheeger constant of a quantum graph
- Distinguishing co-spectral quantum graphs by scattering
- Hubs-biased resistance distances on graphs and networks
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph
- Interlacing and Friedlander-type inequalities for spectral minimal partitions of metric graphs
- Impediments to diffusion in quantum graphs: geometry-based upper bounds on the spectral gap
- Upper Eigenvalue Bounds for the Kirchhoff Laplacian on Embbeded Metric Graphs
- The Inverse Scattering Problem for the Matrix Schrödinger Equation
- Geometric spectral theory of quantum graphs
- Generating isospectral but not isomorphic quantum graphs
- On the spectral gap of the path graph in the limit of large volume