Recognition: unknown
An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
classification
🧮 math.FA
keywords
boundsdirichletgraphslaplacianlowerprincipletermsuncertainty
read the original 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.
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.