An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
Abstract
We prove a quantitative uncertainty principle at low energies for the Laplacian on fairly general weighted graphs with a uniform explicit control of the constants in terms of geometric quantities. A major step consists in establishing lower bounds for Dirichlet eigenvalues in terms of the geometry.
0
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.