SearcharxivSearch

arXiv · 2506.06441

The Zigzag Strategy for Random Band Matrices

Abstract

We prove that a very general class of $N\times N$ Hermitian random band matrices is in the delocalized phase when the band width $W$ exceeds the critical threshold, $W\gg \sqrt{N}$. In this regime, we show that, in the bulk spectrum, the eigenfunctions are fully delocalized, the eigenvalues follow the universal Wigner-Dyson statistics, and quantum unique ergodicity holds for general diagonal observables with an optimal convergence rate. Our results are valid for general variance profiles, arbitrary single entry distributions, in both real-symmetric and complex-Hermitian symmetry classes. In particular, our work substantially generalizes the recent breakthrough result of Yau and Yin [arXiv:2501.01718], obtained for a specific complex Hermitian Gaussian block band matrix. The main technical input is the optimal multi-resolvent local laws -- both in the averaged and fully isotropic form. We also generalize the $\sqrt{\eta}$-rule from [arXiv:2012.13215] to exploit the additional effect of traceless observables. Our analysis is based on the zigzag strategy, complemented with a new global-scale estimate derived using the static version of the master inequalities, while the zig-step and the a priori estimates on the deterministic approximations are proven dynamically.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

László Erdős, Volodymyr Riabov. 2025-06-06. The Zigzag Strategy for Random Band Matrices. https://arxiv.org/abs/2506.06441

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