SearcharxivSearch

arXiv · 0708.1720

On asymptotics of eigenvectors of large sample covariance matrix

Abstract

Let \{$X_{ij}$\}, $i,j=...,$ be a double array of i.i.d. complex random variables with $EX_{11}=0,E|X_{11}|^2=1$ and $E|X_{11}|^4<\infty$, and let $A_n=\frac{1}{N}T_n^{{1}/{2}}X_nX_n^*T_n^{{1}/{2}}$, where $T_n^{{1}/{2}}$ is the square root of a nonnegative definite matrix $T_n$ and $X_n$ is the $n\times N$ matrix of the upper-left corner of the double array. The matrix $A_n$ can be considered as a sample covariance matrix of an i.i.d. sample from a population with mean zero and covariance matrix $T_n$, or as a multivariate $F$ matrix if $T_n$ is the inverse of another sample covariance matrix. To investigate the limiting behavior of the eigenvectors of $A_n$, a new form of empirical spectral distribution is defined with weights defined by eigenvectors and it is then shown that this has the same limiting spectral distribution as the empirical spectral distribution defined by equal weights. Moreover, if \{$X_{ij}$\} and $T_n$ are either real or complex and some additional moment assumptions are made then linear spectral statistics defined by the eigenvectors of $A_n$ are proved to have Gaussian limits, which suggests that the eigenvector matrix of $A_n$ is nearly Haar distributed when $T_n$ is a multiple of the identity matrix, an easy consequence for a Wishart matrix.

Explore related subjects

Keep this discovery

BibTeXRIS

Z. D. Bai, B. Q. Miao, G. M. Pan. 2007-08-13. On asymptotics of eigenvectors of large sample covariance matrix. https://doi.org/10.1214/009117906000001079

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