SearcharxivSearch

arXiv · 2508.18143

The circular law for non-Hermitian random band matrices up to bandwidth $N^{1/2+c}$

Abstract

We consider inhomogeneous square random matrices of size $N$ with independent entries of mean 0 and finite variance. We assume that the variance profile of this matrix is doubly stochastic and has a band-like structure with an appropriately defined bandwidth $W$. We prove that when the entries have a bounded density and a subgaussian tail, then the empirical spectral measure for the eigenvalues of the matrix converges to the circular law as $N$ tends to infinity whenever $W\geq N^{1/2+c}$ for any $c>0$. In the special case of block band matrices the density assumption is not needed and the moment condition is relaxed. This establishes the circular law limit throughout the entire delocalization regime in 1-d: $W\geq N^{1/2+c}$ and extends the previous thresholds for the circular law limit with exponent $\frac{5}{6},\frac{8}{9},\frac{33}{34}$ in $N$. The main technical input is a new lower bound on the small-ish singular values via Green function estimates and a new lower bound on the least singular value with fewer moment conditions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi Han. 2025-08-25. The circular law for non-Hermitian random band matrices up to bandwidth $N^{1/2+c}$. https://arxiv.org/abs/2508.18143

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