English

Anderson localization on random regular graphs

Disordered Systems and Neural Networks 2016-12-28 v2

Abstract

A numerical study of Anderson transition on random regular graphs (RRG) with diagonal disorder is performed. The problem can be described as a tight-binding model on a lattice with N sites that is locally a tree with constant connectivity. In certain sense, the RRG ensemble can be seen as infinite-dimensional (dd\to\infty) cousin of Anderson model in d dimensions. We focus on the delocalized side of the transition and stress the importance of finite-size effects. We show that the data can be interpreted in terms of the finite-size crossover from small (NNcN\ll N_c) to large (NNcN\gg N_c) system, where NcN_c is the correlation volume diverging exponentially at the transition. A distinct feature of this crossover is a nonmonotonicity of the spectral and wavefunction statistics, which is related to properties of the critical phase in the studied model and renders the finite-size analysis highly non-trivial. Our results support an analytical prediction that states in the delocalized phase (and at NNcN\gg N_c) are ergodic in the sense that their inverse participation ratio scales as 1/N1/N.

Keywords

Cite

@article{arxiv.1604.05353,
  title  = {Anderson localization on random regular graphs},
  author = {K. S. Tikhonov and A. D. Mirlin and M. A. Skvortsov},
  journal= {arXiv preprint arXiv:1604.05353},
  year   = {2016}
}
R2 v1 2026-06-22T13:35:20.811Z