An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs (Q2179893)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7200133
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs |
scientific article; zbMATH DE number 7200133 |
Statements
An uncertainty principle and lower bounds for the Dirichlet Laplacian on graphs (English)
0 references
13 May 2020
0 references
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.
0 references
uncertainty principle
0 references
graph Laplacian
0 references
spectral bounds
0 references
0.8731292486190796
0 references
0.8052747845649719
0 references
0.7434225082397461
0 references
0.7263792157173157
0 references
0.7235298156738281
0 references