Anderson localisation in spatially structured random graphs

• URL: http://arxiv.org/abs/2601.00220v1
• Date: Thu, 01 Jan 2026 05:55:42 GMT
• Title: Anderson localisation in spatially structured random graphs
• Authors: Bibek Saha, Sthitadhi Roy,
• Abstract summary: We study Anderson localisation on high-dimensional graphs with spatial structure induced by long-ranged but distance-dependent hopping.<n>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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 interplay of the lengthscale associated to the hopping range and the onsite disorder strength. We find that increasing the hopping range shifts the localisation transition to stronger disorder, and that beyond a critical range the localised phase ceases to exist even at arbitrarily strong disorder. Our results indicate a direct Anderson transition between delocalised and localised phases, with no evidence for an intervening multifractal phase, for both deterministic and random hopping models. A scaling analysis based on inverse participation ratios reveals behaviour consistent with a Kosterlitz-Thouless-like transition with two-parameter scaling, in line with Anderson transitions on high-dimensional graphs. We also observe distinct critical behaviour in average and typical correlation functions, reflecting the different scaling properties of generalised inverse participation ratios.

Related papers

• Localization from Infinitesimal Kinetic Grading: Critical Scaling and Kibble-Zurek Universality [0.0]
  We study a one-dimensional lattice model with site-dependent nearest-neighbor hopping amplitudes that follow a power-law profile.<n>In the thermodynamic limit, the ground state becomes localized as $|| to 0$, signaling the presence of a critical point characterized by a diverging localization length.<n>Our results demonstrate a clean, disorder-free route to localization and provide a tunable platform relevant to photonic lattices and ultracold atom arrays with engineered hopping profiles.
  arXiv  Detail & Related papers  (2025-12-16T17:26:06Z)
• Critical Dynamics of the Anderson Transition on Small-World Graphs [25.98643403956035]
  We construct a unitary Anderson model on Small-World graphs to characterize long time and large size wave-packet dynamics.<n>We reveal the logarithmically slow non-ergodic dynamics in the critical regime, confirming recent random matrix predictions.<n>Our results could be used to clarify the dynamical properties of MBL and could guide future experiments with quantum simulators.
  arXiv  Detail & Related papers  (2025-02-24T06:32:05Z)
• Sparse Training of Discrete Diffusion Models for Graph Generation [45.103518022696996]
  We introduce SparseDiff, a novel diffusion model based on the observation that almost all large graphs are sparse. By selecting a subset of edges, SparseDiff effectively leverages sparse graph representations both during the noising process and within the denoising network. Our model demonstrates state-of-the-art performance across multiple metrics on both small and large datasets.
  arXiv  Detail & Related papers  (2023-11-03T16:50:26Z)
• A U-turn on Double Descent: Rethinking Parameter Counting in Statistical Learning [68.76846801719095]
  We show that double descent appears exactly when and where it occurs, and that its location is not inherently tied to the threshold p=n. This provides a resolution to tensions between double descent and statistical intuition.
  arXiv  Detail & Related papers  (2023-10-29T12:05:39Z)
• Renormalization Group Analysis of the Anderson Model on Random Regular Graphs [0.0]
  We present a renormalization group analysis of the problem of Anderson localization on a Random Regular Graph (RRG) We show that the one- parameter scaling hypothesis is recovered for sufficiently large system sizes for both eigenstates and spectrum observables. We also explain the non-monotonic behavior of dynamical and spectral quantities as a function of the system size for values of disorder close to the transition.
  arXiv  Detail & Related papers  (2023-06-26T18:00:13Z)
• Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting [50.901984244738806]
  We show how to model the evolutionary and multi-scale interactions of time series. In particular, we first provide a hierarchical graph structure cooperated with the dilated convolution to capture the scale-specific correlations. A unified neural network is provided to integrate the components above to get the final prediction.
  arXiv  Detail & Related papers  (2022-06-28T08:11:12Z)
• Universality in Anderson localization on random graphs with varying connectivity [0.0]
  We show that there should be a non-ergodic region above a given value of disorder $W_E$. Although no separate $W_E$ exists from $W_C$, the length scale at which fully developed ergodicity is found diverges like $|W-W_C|-1$. The separation of these two scales at the critical point allows for a true non-ergodic, delocalized region.
  arXiv  Detail & Related papers  (2022-05-29T09:47:39Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)
• Predicting traffic signals on transportation networks using spatio-temporal correlations on graphs [56.48498624951417]
  This paper proposes a traffic propagation model that merges multiple heat diffusion kernels into a data-driven prediction model to forecast traffic signals. We optimize the model parameters using Bayesian inference to minimize the prediction errors and, consequently, determine the mixing ratio of the two approaches. The proposed model demonstrates prediction accuracy comparable to that of the state-of-the-art deep neural networks with lower computational effort.
  arXiv  Detail & Related papers  (2021-04-27T18:17:42Z)
• SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction [64.16212996247943]
  We present a Sparse Graph Convolution Network(SGCN) for pedestrian trajectory prediction. Specifically, the SGCN explicitly models the sparse directed interaction with a sparse directed spatial graph to capture adaptive interaction pedestrians. visualizations indicate that our method can capture adaptive interactions between pedestrians and their effective motion tendencies.
  arXiv  Detail & Related papers  (2021-04-04T03:17:42Z)
• Hyperbolic Graph Embedding with Enhanced Semi-Implicit Variational Inference [48.63194907060615]
  We build off of semi-implicit graph variational auto-encoders to capture higher-order statistics in a low-dimensional graph latent representation. We incorporate hyperbolic geometry in the latent space through a Poincare embedding to efficiently represent graphs exhibiting hierarchical structure.
  arXiv  Detail & Related papers  (2020-10-31T05:48:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.