Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1307.5753

On Eigenvectors of Random Band Matrices with Large Band

Stefan Steinerberger
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study random, symmetric $N \times N$ band matrices with a band of size $W$ and Bernoulli random variables as entries. This interpolates between nearest neighbour interaction $W = 1$ and Wigner matrices $W = N$. Eigenvectors are known to be localized for $W \ll N^{1/8}$, delocalized for $W \gg N^{4/5}$ and it is conjectured that the transition for the bulk occurs at $W \sim N^{1/2}$. Eigenvalues in the spectral edge change their behavior at $W \sim N^{5/6}$ but nothing is known about the associated eigenvectors. We show that up to $W \ll N^{5/7}$ any random matrix has with large probability some eigenvectors in the spectral edge, which either exhibit mass concentration or interact strongly on a small scale.

Explore related subjects

math.PRmath-phmath.MP

Keep this discovery

BibTeXRIS

Stefan Steinerberger. 2013-07-22. On Eigenvectors of Random Band Matrices with Large Band. https://arxiv.org/abs/1307.5753

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗