Anderson localisation in spatially structured random graphs
Bibek Saha, Sthitadhi Roy

TL;DR
This paper investigates Anderson localisation on high-dimensional, spatially structured graphs with long-range hopping, revealing how hopping range influences the localisation transition and phase diagram.
Contribution
It introduces a model interpolating between short-range and fully connected graphs, combining numerical and analytical methods to analyze localisation phenomena.
Findings
Increasing hopping range shifts the localisation transition to stronger disorder.
Beyond a critical hopping range, the localised phase disappears regardless of disorder strength.
The transition appears to be Kosterlitz-Thouless-like with distinct critical behaviours.
Abstract
We study Anderson localisation on high-dimensional graphs with spatial structure induced by long-ranged but distance-dependent hopping. To this end, we introduce a class of models that interpolate between the short-range Anderson model on a random regular graph and fully connected models with statistically uniform hopping, by embedding a random regular graph into a complete graph and allowing hopping amplitudes to decay exponentially with graph distance. The competition between the exponentially growing number of neighbours with graph distance and the exponentially decaying hopping amplitude positions our models effectively as power-law hopping generalisation of the Anderson model on random regular graphs. Using a combination of numerical exact diagonalisation and analytical renormalised perturbation theory, we establish the resulting localisation phase diagram emerging from the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
