SearcharxivSearch

arXiv · 2604.12248

Localization Lengths of Power-Law Random Band Matrices

Abstract

We study large $N\times N$ power-law random band matrices $H=(H_{ij})$ with centered complex Gaussian entries, where the variances satisfy a power-law decay $\mathbb{E}|H_{ij}|^2\propto (|i-j|/W+1)^{-1-\alpha}$, for some exponent $\alpha>-1$ and bandwidth $W\gg 1$. We establish the following lower bounds, with high probability, on the localization length $\ell$ of bulk eigenvectors in the different regimes of $\alpha$: (1) $\ell=N$ if $-1<\alpha<0$; (2) $\ell \ge W^{C}$ for any large constant $C>0$ if $0 < \alpha <1$; (3) $\ell \ge W^{\alpha/(\alpha-1)}$ if $1 < \alpha <2$; (4) $\ell \ge W^{2}$ if $ \alpha > 2$. These results verify the physical conjecture of arXiv:cond-mat/9604163 on the delocalized side. The main difficulty in the proof lies in handling the interplay between the non-mean-field nature of the model and the slow decay of the variance profile. To address this issue, a key technical ingredient is a new dynamical analysis of $T$-variables formed from pairs of resolvent entries of $H$. In contrast to the fundamental works on regular random band matrices with fast-decaying variances in arXiv:2501.01718 and arXiv:2506.06441, this approach does not rely on higher-order resolvent loops.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiaqi Fan, Fan Yang, Jun Yin. 2026-04-14. Localization Lengths of Power-Law Random Band Matrices. https://arxiv.org/abs/2604.12248

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR