Cheeger inequalities for unbounded graph Laplacians
classification
🧮 math.SP
math.COmath.DG
keywords
constantgraphisoperimetricunboundedbottomcheegercheeger-typeconcept
read the original abstract
We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if the vertex degrees are unbounded.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.