SearcharxivSearch

arXiv · 2507.11945

A Block Reduction Method for Random Band Matrices with General Variance Profiles

Abstract

We present a novel block reduction method for the study of a general class of random band matrices (RBM) defined on the $d$-dimensional lattice $\mathbb{Z}_{L}^d:=\{1,2,\ldots,L\}^{d}$ for $d\in \{1,2\}$, with band width $W$ and an almost arbitrary variance profile subject to a core condition. We prove the delocalization of bulk eigenvectors for such RBMs under the assumptions $W\ge L^{1/2+\varepsilon}$ in one dimension and $W\geq L^{\varepsilon}$ in two dimensions, where $\varepsilon$ is an arbitrarily small constant. This result extends the findings of arXiv:2501.01718 and arXiv:2503.07606 on block RBMs to models with general variance profiles. Furthermore, we generalize our results to Wegner orbital models with small interaction strength $\lambda\ll 1$. Under the sharp condition $\lambda\gg W^{-d/2}$, we establish optimal lower bounds for the localization lengths of bulk eigenvectors, thereby extending the results of arXiv:2503.11382 to settings with nearly arbitrary potential and hopping terms. Our block reduction method provides a powerful and flexible framework that reduces both the dynamical analysis of the loop hierarchy and the derivation of deterministic estimates for general RBMs to the corresponding analysis of block RBMs, as developed in arXiv:2501.01718, arXiv:2503.07606 and arXiv:2503.11382.

Explore related subjects

Keep this discovery

BibTeXRIS

Jiaqi Fan, Fan Yang, Jun Yin. 2025-07-16. A Block Reduction Method for Random Band Matrices with General Variance Profiles. https://arxiv.org/abs/2507.11945

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