The large connectivity limit of the Anderson model on tree graphs

From MaRDI portal
Publication:2924879

DOI10.1063/1.4894055zbMATH Open1306.82011arXiv1303.4908OpenAlexW2056369371MaRDI QIDQ2924879FDOQ2924879

Victor Bapst

Publication date: 20 October 2014

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1303.4908





Cites Work


Cited In (9)






This page was built for publication: The large connectivity limit of the Anderson model on tree graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2924879)