SearcharxivSearch

arXiv · 2508.17838

Edge Universality for Inhomogeneous Random Matrices

Abstract

We consider symmetric and Hermitian random matrices whose entries are independent and symmetric random variables with an arbitrary variance pattern. Under a novel Short-to-Long Mixing condition, which is sharp in the sense that it precludes a corrected shift at the spectral edge, we establish GOE/GUE edge universality for such inhomogeneous random matrices. This condition effectively reduces the universality problem to verifying the mixing properties of a random walk governed by the variance profile matrix. Our universality results are applicable to a remarkably broad class of random matrix ensembles that may be highly inhomogeneous, sparse, or far beyond the mean-field setting of classical random matrix theory. Notable examples include: 1. Inhomogeneous Wishart-type random matrices; 2. Random band matrices whose entries are independent random variables with general variance profile, particularly with an optimal bandwidth in dimensions $d \le 2$; 3. Sparse random matrices with structured variance profiles; 4. Generalized Wigner matrices under significantly weaker sparsity constraints and heavy-tailed entry distributions; 5. Wegner orbital models under sharp mixing assumptions; 6. Random 2-lifts of random $d$-regular graphs where $d\geq N^{2/3+\epsilon}$ for any $\epsilon>0$.

Explore related subjects

Keep this discovery

BibTeXRIS

Dang-Zheng Liu, Guangyi Zou. 2025-08-25. Edge Universality for Inhomogeneous Random Matrices. https://arxiv.org/abs/2508.17838

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