arXiv:1303.4908 [math.PR]AbstractReferencesReviewsResources
The Large Connectivity Limit of the Anderson Model on Tree Graphs
Published 2013-03-20, updated 2014-09-09Version 3
We consider the Anderson localization problem on the infinite regular tree. Within the localized phase, we derive a rigorous lower bound on the free energy function recently introduced by Aizenman and Warzel. Using a finite volume regularization, we also derive an upper bound on this free energy function. This yields upper and lower bounds on the critical disorder such that all states at a given energy become localized. These bounds are particularly useful in the large connectivity limit where they match, confirming the early predictions of Abou-Chacra, Anderson and Thouless.
Comments: 20 pages, 3 figures (published version)
Journal: J. Math. Phys. 55, 092101 (2014)
DOI: 10.1063/1.4894055
Tags: journal article
Related articles: Most relevant | Search more
arXiv:1003.0334 [math.PR] (Published 2010-03-01)
A lower bound on the critical parameter of interlacement percolation in high dimension
arXiv:1905.03031 [math.PR] (Published 2019-05-08)
New Lower Bounds for Trace Reconstruction
arXiv:math/0702879 [math.PR] (Published 2007-02-28)
Lower bounds for the density of locally elliptic Itô processes