Spectral Estimates for Infinite Quantum Graphs
arXiv:1711.02428 · doi:10.1007/s00526-018-1454-3
Abstract
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then prove the Cheeger-type estimate. Our definition of the isoperimetric constant is purely combinatorial and thus it establishes connections with the combinatorial isoperimetric constant, one of the central objects in spectral graph theory and in the theory of simple random walks on graphs. The latter enables us to prove a number of criteria for quantum graphs to be uniformly positive or to have purely discrete spectrum. We demonstrate our findings by considering trees, antitrees and Cayley graphs of finitely generated groups.
arXiv comment38 pages; 2 figures
References in corpus (11)
- Spectra of self-adjoint extensions and applications to solvable Schroedinger operators
- On the Spectral Gap of a Quantum Graph
- Spectral Theory of Infinite Quantum Graphs
- Edge connectivity and the spectral gap of combinatorial and quantum graphs
- Quantum graphs which optimize the spectral gap
- Unitary dimension reduction for a class of self-adjoint extensions with applications to graph-like structures
- General Cheeger inequalities for p-Laplacians on graphs
- An example of unitary equivalence between self-adjoint extensions and their parameters
- Volume growth and bounds for the essential spectrum for Dirichlet forms
- The Cheeger constant of a quantum graph
- New relations between discrete and continuous transition operators on (metric) graphs
Cited by in corpus (5)
- Self-adjoint and Markovian extensions of infinite quantum graphs
- A note on the Gaffney Laplacian on infinite metric graphs
- Impediments to diffusion in quantum graphs: geometry-based upper bounds on the spectral gap
- Some spectral comparison results on infinite quantum graphs
- The -adjacency operators and adjacency Jacobi matrix on distance-regular graphs