A Block Reduction Method for Random Band Matrices with General Variance Profiles
Jiaqi Fan, Fan Yang, Jun Yin
TL;DR
The paper develops a block-reduction framework for random band matrices with general variance profiles, establishing bulk delocalization in 1D and 2D under near-optimal band-width conditions and extending to Wegner orbital models with precise interaction strength scaling. Central to the approach is a block-structured flow of variance profiles that restores a self-consistent loop hierarchy, together with a random-walk representation for Theta-propagators and deterministic bounds on K-loops. By combining global resolvent laws with a detailed loop-hierarchy analysis and a flow-based propagation to local scales, the authors prove sharp local laws, isotropic delocalization results, and optimal bounds on localization lengths in the generalized setting. The block reduction methodology thus provides a flexible and robust tool to handle broad variance profiles and inter-block couplings, bridging previous BlockRBM results and Wegner-model analyses while clarifying the limits of current techniques in higher dimensions.
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 $λ\ll 1$. Under the sharp condition $λ\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.
