SearcharxivSearch

arXiv · 2407.12182

Outliers for deformed inhomogeneous random matrices

Abstract

Inhomogeneous random matrices with non-trivial variance profiles determined by symmetric stochastic matrices and with independent sub-Gaussian entries up to Hermitian symmetry, encompass a wide range of important models, including sparse Wigner matrices and random band matrices. In these models, the maximum entry variance-a natural proxy for sparsity-serves both as a key structural feature and a primary analytical obstacle. In this paper, we consider low-rank additive perturbations of such matrices and establish a sharp BBP phase transition for extreme eigenvalues at the level of the law of large numbers. Furthermore, in the Gaussian setting, we derive the fluctuations of spectral outliers under suitable conditions on the variance profile and perturbation. These fluctuations exhibit strong non-universality, depending on the eigenvectors, sparsity levels, and the underlying geometric structure. Our proof strategies rely on ribbon graph expansions, upper bounds for diagram functions, large-moment estimates, and the enumeration of typical diagrams.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruohan Geng, Dang-Zheng Liu, Guangyi Zou. 2024-07-16. Outliers for deformed inhomogeneous random matrices. https://arxiv.org/abs/2407.12182

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