Saved in:
Bibliographic Details
Main Authors: Shou, Laura, Wang, Wei, Zhang, Shiwen
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2212.07589
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916172532809728
author Shou, Laura
Wang, Wei
Zhang, Shiwen
author_facet Shou, Laura
Wang, Wei
Zhang, Shiwen
contents We consider the localization landscape function $u$ 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 $λ\|u\|_\infty$ for several models, including the Anderson model and random hopping (bond-disordered) models, on graphs that are roughly isometric to $\mathbb{Z}^d$, as well as on some fractal-like graphs such as the Sierpinski gasket graph. Next, we specialize to a random hopping model on $\mathbb{Z}$, and show that as the size of the chain grows, the landscape product $λ\|u\|_\infty$ approaches $π^2/8$ for Bernoulli off-diagonal disorder, and has the same upper bound of $π^2/8$ 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.
format Preprint
id arxiv_https___arxiv_org_abs_2212_07589
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Landscape approximation of the ground state eigenvalue for graphs and random hopping models
Shou, Laura
Wang, Wei
Zhang, Shiwen
Mathematical Physics
Spectral Theory
We consider the localization landscape function $u$ 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 $λ\|u\|_\infty$ for several models, including the Anderson model and random hopping (bond-disordered) models, on graphs that are roughly isometric to $\mathbb{Z}^d$, as well as on some fractal-like graphs such as the Sierpinski gasket graph. Next, we specialize to a random hopping model on $\mathbb{Z}$, and show that as the size of the chain grows, the landscape product $λ\|u\|_\infty$ approaches $π^2/8$ for Bernoulli off-diagonal disorder, and has the same upper bound of $π^2/8$ 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.
title Landscape approximation of the ground state eigenvalue for graphs and random hopping models
topic Mathematical Physics
Spectral Theory
url https://arxiv.org/abs/2212.07589