SearcharxivSearch

arXiv · 1908.07444

Extremal eigenvalues of sample covariance matrices with general population

Abstract

We consider the eigenvalues of sample covariance matrices of the form $\mathcal{Q}=(\Sigma^{1/2}X)(\Sigma^{1/2}X)^*$. The sample $X$ is an $M\times N$ rectangular random matrix with real independent entries and the population covariance matrix $\Sigma$ is a positive definite diagonal matrix independent of $X$. Assuming that the limiting spectral density of $\Sigma$ exhibits convex decay at the right edge of the spectrum, in the limit $M, N \to \infty$ with $N/M \to d\in(0,\infty)$, we find a certain threshold $d_+$ such that for $d>d_+$ the limiting spectral distribution of $\mathcal{Q}$ also exhibits convex decay at the right edge of the spectrum. In this case, the largest eigenvalues of $\mathcal{Q}$ are determined by the order statistics of the eigenvalues of $\Sigma$, and in particular, the limiting distribution of the largest eigenvalue of $\mathcal{Q}$ is given by a Weibull distribution. In case $d<d_+$, we also prove that the limiting distribution of the largest eigenvalue of $\caQ$ is Gaussian if the entries of $\Sigma$ are i.i.d. random variables. While $\Sigma$ is considered to be random mostly, the results also hold for deterministic $\Sigma$ with some additional assumptions.

Explore related subjects

Keep this discovery

BibTeXRIS

Jinwoong Kwak, Ji Oon Lee, Jaewhi Park. 2019-08-17. Extremal eigenvalues of sample covariance matrices with general population. https://arxiv.org/abs/1908.07444

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