SearcharxivSearch

arXiv · 0809.4698

Central limit theorem for linear eigenvalue statistics of random matrices with independent entries

Abstract

We consider $n\times n$ real symmetric and Hermitian Wigner random matrices $n^{-1/2}W$ with independent (modulo symmetry condition) entries and the (null) sample covariance matrices $n^{-1}X^*X$ with independent entries of $m\times n$ matrix $X$. Assuming first that the 4th cumulant (excess) $κ_4$ of entries of $W$ and $X$ is zero and that their 4th moments satisfy a Lindeberg type condition, we prove that linear statistics of eigenvalues of the above matrices satisfy the central limit theorem (CLT) as $n\to\infty$, $m\to\infty$, $m/n\to c\in[0,\infty)$ with the same variance as for Gaussian matrices if the test functions of statistics are smooth enough (essentially of the class $\mathbf{C}^5$). This is done by using a simple ``interpolation trick'' from the known results for the Gaussian matrices and the integration by parts, presented in the form of certain differentiation formulas. Then, by using a more elaborated version of the techniques, we prove the CLT in the case of nonzero excess of entries again for essentially $\mathbb{C}^5$ test function. Here the variance of statistics contains an additional term proportional to $κ_4$. The proofs of all limit theorems follow essentially the same scheme.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Lytova, L. Pastur. 2009-09-25. Central limit theorem for linear eigenvalue statistics of random matrices with independent entries. https://doi.org/10.1214/09-aop452

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