2000 character limit reached
Cheeger inequalities for unbounded graph Laplacians (1209.4911v1)
Published 21 Sep 2012 in math.SP, math.CO, and math.DG
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.