Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSub-diffusion in the Anderson model on random regular graph
139
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the finite-time dynamics of an initially localized wave-packet in the Anderson model on the random regular graph (RRG). Considering the full probability distribution $Pi(x,t)$ of a particle to be at some distance $x$ from the initial state at time $t$, we give evidence that $Pi(x,t)$ spreads sub-diffusively over a range of disorder strengths, wider than a putative non-ergodic phase. We provide a detailed analysis of the propagation of $Pi(x,t)$ in space-time $(x,t)$ domain, identifying four different regimes. These regimes in $(x,t)$ are determined by the position of a wave-front $X_{text{front}}(t)$, which moves sub-diffusively to the most distant sites $X_{text{front}}(t) sim t^{beta}$ with an exponent $beta < 1$. We support our numerical results by a self-consistent semiclassical picture of wavepacket propagation relating the exponent $beta$ with the relaxation rate of the return probability $Pi(0,t) sim e^{-Gamma t^beta}$. Importantly, the Anderson model on the RRG can be considered as proxy of the many-body localization transition (MBL) on the Fock space of a generic interacting system. In the final discussion, we outline possible implications of our findings for MBL.
rate research
Read More
We present a full description of the nonergodic properties of wavefunctions on random graphs without boundary in the localized and critical regimes of the Anderson transition. We find that they are characterized by two critical localization lengths: the largest one describes localization along rare branches and diverges with a critical exponent $ u_parallel=1$ at the transition. The second length, which describes localization along typical branches, reaches at the transition a finite universal value (which depends only on the connectivity of the graph), with a singularity controlled by a new critical exponent $ u_perp=1/2$. We show numerically that these two localization lengths control the finite-size scaling properties of key observables: wavefunction moments, correlation functions and spectral statistics. Our results are identical to the theoretical predictions for the typical localization length in the many-body localization transition, with the same critical exponent. This strongly suggests that the two transitions are in the same universality class and that our techniques could be directly applied in this context.
The Anderson transitions in a random magnetic field in three dimensions are investigated numerically. The critical behavior near the transition point is analyzed in detail by means of the transfer matrix method with high accuracy for systems both with and without an additional random scalar potential. We find the critical exponent $ u$ for the localization length to be $1.45 pm 0.09$ with a strong random scalar potential. Without it, the exponent is smaller but increases with the system sizes and extrapolates to the above value within the error bars. These results support the conventional classification of universality classes due to symmetry. Fractal dimensionality of the wave function at the critical point is also estimated by the equation-of-motion method.
We study the performance of different message passing algorithms in the two dimensional Edwards Anderson model. We show that the standard Belief Propagation (BP) algorithm converges only at high temperature to a paramagnetic solution. Then, we test a Generalized Belief Propagation (GBP) algorithm, derived from a Cluster Variational Method (CVM) at the plaquette level. We compare its performance with BP and with other algorithms derived under the same approximation: Double Loop (DL) and a two-ways message passing algorithm (HAK). The plaquette-CVM approximation improves BP in at least three ways: the quality of the paramagnetic solution at high temperatures, a better estimate (lower) for the critical temperature, and the fact that the GBP message passing algorithm converges also to non paramagnetic solutions. The lack of convergence of the standard GBP message passing algorithm at low temperatures seems to be related to the implementation details and not to the appearance of long range order. In fact, we prove that a gauge invariance of the constrained CVM free energy can be exploited to derive a new message passing algorithm which converges at even lower temperatures. In all its region of convergence this new algorithm is faster than HAK and DL by some orders of magnitude.
We present strong numerical evidence for the existence of a localization-delocalization transition in the eigenstates of the 1-D Anderson model with long-range hierarchical hopping. Hierarchical models are important because of the well-known mapping between their phases and those of models with short range hopping in higher dimensions, and also because the renormalization group can be applied exactly without the approximations that generally are required in other models. In the hierarchical Anderson model we find a finite critical disorder strength Wc where the average inverse participation ratio goes to zero; at small disorder W < Wc the model lies in a delocalized phase. This result is based on numerical calculation of the inverse participation ratio in the infinite volume limit using an exact renormalization group approach facilitated by the models hierarchical structure. Our results are consistent with the presence of an Anderson transition in short-range models with D > 2 dimensions, which was predicted using renormalization group arguments. Our finding should stimulate interest in the hierarchical Anderson model as a simplified and tractable model of the Anderson localization transition which occurs in finite-dimensional systems with short-range hopping.
A recent interesting paper [Yucesoy et al. Phys. Rev. Lett. 109, 177204 (2012), arXiv:1206:0783] compares the low-temperature phase of the 3D Edwards-Anderson (EA) model to its mean-field counterpart, the Sherrington-Kirkpatrick (SK) model. The authors study the overlap distributions P_J(q) and conclude that the two models behave differently. Here we notice that a similar analysis using state-of-the-art, larger data sets for the EA model (generated with the Janus computer) leads to a very clear interpretation of the results of Yucesoy et al., showing that the EA model behaves as predicted by the replica symmetry breaking (RSB) theory.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
