Volume growth and spectrum for general graph Laplacians
Abstract
We prove estimates relating exponential or sub-exponential volume growth of weighted graphs to the bottom of the essential spectrum for general graph Laplacians. The volume growth is computed with respect to a metric adapted to the Laplacian, and use of these metrics produces better results than those obtained from consideration of the graph metric only. Conditions for absence of the essential spectrum are also discussed. These estimates are shown to be optimal or near-optimal in certain settings and apply even if the Laplacian under consideration is an unbounded operator.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.