Anderson localization and ergodicity on random regular graphs

A disordered quantum system can be driven, e.g., by increasing disorder, through the Anderson transition between a delocalized and localized phase. Recently, Anderson localization on treelike graphs has attracted much attention in view of its connections with problems of many-body localization. One of the central questions in this context is that of ergodicity of eigenstates. The authors of this paper perform a numerical study of Anderson transition on random regular graphs (RRGs) with diagonal disorder. The problem can be described as a tight-binding model on a lattice with N sites that is locally a tree with constant connectivity. Focusing on the delocalized side of the transition, they show that the data can be interpreted in terms of the finite-size crossover from a small (NNc) to a large (NNc) system, where Nc is the correlation volume diverging exponentially at the transition. A distinct feature of this crossover is a nonmonotonicity of the spectral and wave-function statistics, which is related to properties of the critical phase in the studied model and renders the finite-size analysis highly nontrivial. The results support an analytical prediction that states in the delocalized phase (and at NNc) are ergodic.