Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Advances in Mathematical Physics

Direct Scaling Analysis of Fermionic Multiparticle Correlated Anderson Models with Infinite-Range Interaction

Victor Chulaevsky

Published Jan 1, 2016• 2 citations
Publisher

Abstract

We adapt the method of direct scaling analysis developed earlier for single-particle Anderson models, to the fermionic multiparticle models with finite or infinite interaction on graphs. Combined with a recent eigenvalue concentration bound for multiparticle systems, the new method leads to a simpler proof of the multiparticle dynamical localization with optimal decay bounds in a natural distance in the multiparticle configuration space, for a large class of strongly mixing random external potentials. Earlier results required the random potential to be IID.

DOI
10.1155/2016/2129682

Related papers

Localization on Certain Graphs with Strongly Correlated Disorder

Sthitadhi Roy, David E. Logan

Many-body localization in interacting quantum systems can be cast as a disordered hopping problem on the underlying Fock-space graph. A crucial feature of the effective Fock-space disorder is that the Fock-space site energies are strongly correlated-maximally so for sites separated by a finite distance on the graph. Motivated by this, and to understand the effect of such correlations more fundamentally, we study Anderson localization on Cayley trees and random regular graphs, with maximally correlated disorder. Since such correlations suppress short distance fluctuations in the disorder potential, one might naively suppose they disfavor localization. We find however that there exists an Anderson transition, and indeed that localization is more robust in the sense that the critical disorder scales with graph connectivity K as sqrt[K], in marked contrast to KlnK in the uncorrelated case. This scaling is argued to be intimately connected to the stability of many-body localization. Our analysis centers on an exact recursive formulation for the local propagators as well as a self-consistent mean-field theory; with results corroborated using exact diagonalization.

arXiv:2007.10357•Physical Review Letters•Dec 15, 2020•38 citations

Universality in Anderson localization on random graphs with varying connectivity

Piotr Sierant, Maciej Lewenstein, Antonello Scardicchio

We perform a thorough and complete analysis of the Anderson localization transition on several models of random graphs with regular and random connectivity. The unprecedented precision and abundance of our exact diagonalization data (both spectra and eigenstates), together with new finite size scaling and statistical analysis of the graph ensembles, unveils a universal behavior which is described by two simple, integer, scaling exponents. A by-product of such analysis is a reconciliation of the tension between the results of perturbation theory coming from strong disorder and earlier numerical works, which seemed to suggest that there should be a non-ergodic region above a given value of disorder W_{E} W E which is strictly less than the Anderson localization critical disorder W_C W C , and that of other works which suggest that there is no such region. We find that, although no separate W_{E} W E exists from W_C W C , the length scale at which fully developed ergodicity is found diverges like |W-W_C|^{-1} | W − W C | − 1 , while the critical length over which delocalization develops is \sim |W-W_C|^{-1/2} ∼ | W − W C | − 1 / 2 . The separation of these two scales at the critical point allows for a true non-ergodic, delocalized region. In addition, by looking at eigenstates and studying leading and sub-leading terms in system size-dependence of participation entropies, we show that the former contain information about the non-ergodicity volume which becomes non-trivial already deep in the delocalized regime. We also discuss the quantitative similarities between the Anderson transition on random graphs and many-body localization transition.

SciPost Physics•Aug 3, 2023•43 citations

Universality in Anderson localization on random graphs with varying connectivity

Piotr Sierant, Maciej Lewenstein, Antonello Scardicchio

We perform a thorough and complete analysis of the Anderson localization transition on several models of random graphs with regular and random connectivity. The unprecedented precision and abundance of our exact diagonalization data (both spectra and eigenstates), together with new finite size scaling and statistical analysis of the graph ensembles, unveils a universal behavior which is described by two simple, integer, scaling exponents. A by-product of such analysis is a reconciliation of the tension between the results of perturbation theory coming from strong disorder and earlier numerical works, which seemed to suggest that there should be a non-ergodic region above a given value of disorder $W_{E}$ which is strictly less than the Anderson localization critical disorder $W_C$, and that of other works which suggest that there is no such region. We find that, 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}$, while the critical length over which delocalization develops is $\sim |W-W_C|^{-1/2}$. The separation of these two scales at the critical point allows for a true non-ergodic, delocalized region. In addition, by looking at eigenstates and studying leading and sub-leading terms in system size-dependence of participation entropies, we show that the former contain information about the non-ergodicity volume which becomes non-trivial already deep in the delocalized regime. We also discuss the quantitative similarities between the Anderson transition on random graphs and many-body localization transition.

arXiv:2205.14614•May 29, 2022•1 citation

Renormalization group analysis of the Anderson model on random regular graphs

Carlo Vanoni, B. L. Altshuler, V. E. Kravtsov +1 more

We present a renormalization group (RG) analysis of the problem of Anderson localization on a random regular graph (RRG) which generalizes the RG of Abrahams, Anderson, Licciardello, and Ramakrishnan to infinite-dimensional graphs. The RG equations necessarily involve two parameters (one being the changing connectivity of subtrees), but 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 nonmonotonic behavior of dynamical and spectral quantities as a function of the system size for values of disorder close to the transition, by identifying two terms in the beta function of the running fractal dimension of different signs and functional dependence. Our theory provides a simple and coherent explanation for the unusual scaling behavior observed in numerical data of the Anderson model on RRG and of many-body localization.

arXiv:2306.14965•Proceedings of the National Academy of Sciences•Jul 11, 2024•32 citations

Subdiffusive Thouless time scaling in the Anderson model on random regular graphs

Luis Colmenárez, David J. Luitz, Ivan M. Khaymovich +1 more

Strong disorder usually gives rise to slow transport regimes in quantum many-body systems. The Thouless time scaling with system size, probed by long-range spectral correlations, allows distinguishing diffusive, subdiffusive, and localized dynamics regimes. Here, the authors investigate the Thouless time in the Anderson model on regular random graphs, a proxy for many-body localization. These results support the existence of a subdiffusive regime anticipating the localized phase.

arXiv:2201.04673•Physical review. B./Physical review. B•May 20, 2022•36 citations

Anderson localisation in spatially structured random graphs

Bibek Saha, Sthitadhi Roy

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.

cond-mat.dis-nnCross-listedarXiv:2601.00220•Physical review. B./Physical review. B•Jan 2, 2026•2 citations
We adapt the method of direct scaling analysis developed earlier for single-particle Anderson models, to the fermionic multiparticle models with finite or infinite interaction on graphs. Combined with a recent eigenvalue concentration bound for multiparticle systems, the new method leads to a simpler proof of the multiparticle dynamical localization with optimal decay bounds in a natural distance in the multiparticle configuration space, for a large class of strongly mixing random external potentials. Earlier results required the random potential to be IID.
Many-body localization in interacting quantum systems can be cast as a disordered hopping problem on the underlying Fock-space graph. A crucial feature of the effective Fock-space disorder is that the Fock-space site energies are strongly correlated-maximally so for sites separated by a finite distance on the graph. Motivated by this, and to understand the effect of such correlations more fundamentally, we study Anderson localization on Cayley trees and random regular graphs, with maximally correlated disorder. Since such correlations suppress short distance fluctuations in the disorder potential, one might naively suppose they disfavor localization. We find however that there exists an Anderson transition, and indeed that localization is more robust in the sense that the critical disorder scales with graph connectivity K as sqrt[K], in marked contrast to KlnK in the uncorrelated case. This scaling is argued to be intimately connected to the stability of many-body localization. Our analysis centers on an exact recursive formulation for the local propagators as well as a self-consistent mean-field theory; with results corroborated using exact diagonalization.
We perform a thorough and complete analysis of the Anderson localization transition on several models of random graphs with regular and random connectivity. The unprecedented precision and abundance of our exact diagonalization data (both spectra and eigenstates), together with new finite size scaling and statistical analysis of the graph ensembles, unveils a universal behavior which is described by two simple, integer, scaling exponents. A by-product of such analysis is a reconciliation of the tension between the results of perturbation theory coming from strong disorder and earlier numerical works, which seemed to suggest that there should be a non-ergodic region above a given value of disorder W_{E} W E which is strictly less than the Anderson localization critical disorder W_C W C , and that of other works which suggest that there is no such region. We find that, although no separate W_{E} W E exists from W_C W C , the length scale at which fully developed ergodicity is found diverges like |W-W_C|^{-1} | W − W C | − 1 , while the critical length over which delocalization develops is \sim |W-W_C|^{-1/2} ∼ | W − W C | − 1 / 2 . The separation of these two scales at the critical point allows for a true non-ergodic, delocalized region. In addition, by looking at eigenstates and studying leading and sub-leading terms in system size-dependence of participation entropies, we show that the former contain information about the non-ergodicity volume which becomes non-trivial already deep in the delocalized regime. We also discuss the quantitative similarities between the Anderson transition on random graphs and many-body localization transition.
We perform a thorough and complete analysis of the Anderson localization transition on several models of random graphs with regular and random connectivity. The unprecedented precision and abundance of our exact diagonalization data (both spectra and eigenstates), together with new finite size scaling and statistical analysis of the graph ensembles, unveils a universal behavior which is described by two simple, integer, scaling exponents. A by-product of such analysis is a reconciliation of the tension between the results of perturbation theory coming from strong disorder and earlier numerical works, which seemed to suggest that there should be a non-ergodic region above a given value of disorder WEW_{E}WE​ which is strictly less than the Anderson localization critical disorder WCW_CWC​, and that of other works which suggest that there is no such region. We find that, although no separate WEW_{E}WE​ exists from WCW_CWC​, the length scale at which fully developed ergodicity is found diverges like ∣W−WC∣−1|W-W_C|^{-1}∣W−WC​∣−1, while the critical length over which delocalization develops is ∼∣W−WC∣−1/2\sim |W-W_C|^{-1/2}∼∣W−WC​∣−1/2. The separation of these two scales at the critical point allows for a true non-ergodic, delocalized region. In addition, by looking at eigenstates and studying leading and sub-leading terms in system size-dependence of participation entropies, we show that the former contain information about the non-ergodicity volume which becomes non-trivial already deep in the delocalized regime. We also discuss the quantitative similarities between the Anderson transition on random graphs and many-body localization transition.
We present a renormalization group (RG) analysis of the problem of Anderson localization on a random regular graph (RRG) which generalizes the RG of Abrahams, Anderson, Licciardello, and Ramakrishnan to infinite-dimensional graphs. The RG equations necessarily involve two parameters (one being the changing connectivity of subtrees), but 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 nonmonotonic behavior of dynamical and spectral quantities as a function of the system size for values of disorder close to the transition, by identifying two terms in the beta function of the running fractal dimension of different signs and functional dependence. Our theory provides a simple and coherent explanation for the unusual scaling behavior observed in numerical data of the Anderson model on RRG and of many-body localization.
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.