2000 character limit reached
An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
Published 23 Jun 2016 in math.FA | (1606.07476v2)
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.
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.