An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
In recent studies of random Schrödinger operators, states have been extended so that the norms of restrictions to ``nicely spread out subsets remain relevant. This property is known as uncertainty principle. In the present paper, the authors deal with the (quantitative) uncertainty property for low energy states for graph Laplacians and establish a uniform estimate for large classes of graphs with an explicit control of constants. They also provide new insight for special cases by detailing the comparison of their results with those for the usual Euclidean lattices.
- Lower bounds for Dirichlet Laplacians and uncertainty principles
- Universal lower bounds for Laplacians on weighted graphs
- A Family of Diameter-Based Eigenvalue Bounds for Quantum Graphs
- Graph theoretic uncertainty and feasibility
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- The uncertainty principle on Cayley graphs
- Lower bounds for Dirichlet Laplacians and uncertainty principles
- Geometry, dynamics and spectrum of operators on discrete spaces. Abstracts from the workshop held January 3--9, 2021 (online meeting)
- Universal lower bounds for Laplacians on weighted graphs
- Graph theoretic uncertainty and feasibility
- Unique continuation estimates on manifolds with Ricci curvature bounded below
- Agmon estimates for Schrödinger operators on graphs
This page was built for publication: An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179893)