Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2603.21369

Signatures of Nonergodicity in Sparse Random Matrices

Sagnik Seth·Adway Kumar Das·Anandamohan Ghosh
View original source ↗Read source document ↗Export metadata ↓

Abstract

The prevalence of sparsity in the Fock space graph of interacting many-body systems motivates an investigation into the spectral statistics of sparse random matrices with on-site disorder. We numerically determine the delocalization-localization transition in the ground state as a function of the sparsity. The short-range energy correlation in the bulk indicates that the Anderson transition at infinite temperature occurs at the critical percolation limit of the sparse graph. By analytically deriving the energy moments and calculating the shifted kurtosis, we show that the critical sparsity threshold matches the Anderson transition. Furthermore, long-range energy correlations in the bulk spectrum reveal a Thouless energy scale, suggesting a broad nonergodic regime within the delocalized phase.

Explore related subjects

cond-mat.dis-nncond-mat.stat-mech

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sagnik Seth, Adway Kumar Das, Anandamohan Ghosh. 2026-09-18. Signatures of Nonergodicity in Sparse Random Matrices. https://doi.org/10.1103/x4tm-9249

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn↗
arXiv2026

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn↗
arXiv2026

The infinite volume limit of the Hopfield neural networks in the replica-symmetric regime

Despite extensive research over the past five decades, a rigorous determination of the infinite-volume limit of the free energy of the Hopfield model with an extensive number of patterns has remained an outstanding open problem as standard methods from spin-glass theory have so far proven inadequate for this purpose. While a complete proof for finite, non-vanishing, loads is still out of reach, here we develop a novel interpolation strategy that allows us to express the free energy of the Hopfield model in terms of a linear combination of the free energies of hard- and soft-spin glass models along with a remainder contribution. The payoff of this interpolation scheme is twofold: (i) As the remainder involves positive-definite fluctuations of the order parameters (and it vanishes under a concentration assumption on their means where we consistently recover the replica-symmetric picture) such an expression finally constitutes a rigorous {\em bound} on the exact free energy, rather than just an {\em approximation,} as it was the case for earlier interpolation procedures à la Guerra. \newline (ii) As for the spin-glass models the existence of the infinite-volume free energy has been previously determined by the Guerra--Toninelli scheme, this novel interpolation allows us to extend its validity to the Hopfield model too. Yet, as the equivalence between the Hopfield model and mixtures of spin-glasses is currently well established under replica symmetry and up to the first step of replica symmetry breaking, at present our approach can be rigorously implemented only within these regimes. \newline In this work, by inspecting how the order parameters have to self-average around their means, we restrict our attention to the replica-symmetric regime.

cond-mat.dis-nn↗