arXiv · 1903.02382
Universal lower bounds for Laplacians on weighted graphs
Abstract
We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero eigenvalue in the finite volume case and the first eigenvalue of the Dirichlet Laplacian on subsets that satisfy natural geometric conditions.
Explore related subjects
Keep this discovery
Daniel Lenz, Peter Stollmann. 2019-03-06. Universal lower bounds for Laplacians on weighted graphs. https://arxiv.org/abs/1903.02382
Cite the original work for its findings. Save a collection to share your selection of sources.