SearcharxivSearch

arXiv · 2501.01079

Spectral radius concentration for inhomogeneous random matrices with independent entries

Abstract

Let $A$ be a square random matrix of size $n$, with mean zero, independent but not identically distributed entries, with variance profile $S$. When entries are i.i.d. with unit variance, the spectral radius of $n^{-1/2}A$ converges to $1$ whereas the operator norm converges to 2. Motivated by recent interest in inhomogeneous random matrices, in particular non-Hermitian random band matrices, we formulate general upper bounds for $\rho(A)$, the spectral radius of $A$, in terms of the variance $S$. We prove (1) after suitable normalization $\rho(A)$ is bounded by $1+\epsilon$ up to the optimal sparsity $\sigma_*\gg (\log n)^{-1/2}$ where $\sigma_*$ is the largest standard deviation of an individual entry; (2) a small deviation inequality for $\rho(A)$ capturing fluctuation beyond the optimal scale $\sigma_*^{-1}$; (3) a large deviation inequality for $\rho(A)$ with Gaussian entries and doubly stochastic variance; and (4) boundedness of $\rho(A)$ in certain heavy-tailed regimes with only $2+\epsilon$ finite moments and inhomogeneous variance profile $S$. The proof relies heavily on the trace moment method.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi Han. 2025-01-02. Spectral radius concentration for inhomogeneous random matrices with independent entries. https://arxiv.org/abs/2501.01079

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