Landscape approximation of the ground state eigenvalue for graphs and random hopping models
arXiv:2212.07589 · doi:10.1016/j.jfa.2024.110339
Abstract
We consider the localization landscape function and ground state eigenvalue for operators on graphs. We first show that the maximum of the landscape function is comparable to the reciprocal of the ground state eigenvalue if the operator satisfies certain semigroup kernel upper bounds. This implies general upper and lower bounds on the landscape product for several models, including the Anderson model and random hopping (bond-disordered) models, on graphs that are roughly isometric to , as well as on some fractal-like graphs such as the Sierpinski gasket graph. Next, we specialize to a random hopping model on , and show that as the size of the chain grows, the landscape product approaches for Bernoulli off-diagonal disorder, and has the same upper bound of for Uniform([0,1]) off-diagonal disorder. We also numerically study the random hopping model when the band width (hopping distance) is greater than one, and provide strong numerical evidence that a similar approximation holds for low-lying energies in the spectrum.
arXiv comment44 pages, 10 figures
References in corpus (9)
- Effective confining potential of quantum states in disordered media
- Localization of eigenfunctions via an effective potential
- The effective potential of an -matrix
- -estimates for the torsion function and -growth of semigroups satisfying Gaussian bounds
- The exponential decay of eigenfunctions for tight binding Hamiltonians via landscape and dual landscape functions
- The landscape law for tight binding Hamiltonians
- Approximating the ground state eigenvalue via the effective potential
- Ground State Energy of the One-Dimensional Discrete Random Schrödinger Operator with Bernoulli Potential
- Principal Eigenvalue and Landscape Function of the Anderson Model on a Large Box