Anderson localization on random regular graphs

Understand

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 ($d\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.