The distributions of the smallest and largest eigenvalues for the matrix product $Z^\dagger Z$, where $Z$ is an $n \times m$ complex Gaussian matrix with correlations both along rows and down columns, are expressed as $m \times m$ determinants. In the case of correlation along rows, these expressions are computationally more efficient than those involving sums over partitions and Schur polynomials reported recently for the same distributions.
We consider large complex random sample covariance matrices obtained from "spiked populations", that is when the true covariance matrix is diagonal with all but finitely many eigenvalues equal to one. We investigate the limiting behavior of the largest eigenvalues when the population and the sample sizes both become large. Under some conditions on moments of the sample distribution, we prove that the asymptotic fluctuations of the largest eigenvalues are the same as for a complex Gaussian sample with the same true covariance. The real setting is also considered.
After proper rescaling and under some technical assumptions, the smallest eigenvalue of a sample covariance matrix with aspect ratio bounded away from 1 converges to the Tracy--Widom distribution. This complements the results on the largest eigenvalue, due to Soshnikov and Peche.
We prove a central limit theorem for the difference of linear eigenvalue statistics of a sample covariance matrix $\widetilde{W}$ and its minor $W$. We find that the fluctuation of this difference is much smaller than those of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of $\widetilde{W}$ and $W$. Our result identifies the fluctuation of the spatial derivative of the approximate Gaussian field in the recent paper by Dumitru and Paquette. Unlike in a similar result for Wigner matrices, for sample covariance matrices the fluctuation may en…
Let $M_n$ be a $n \times n$ Wigner or sample covariance random matrix, and let $μ_1(M_n), μ_2(M_n), ..., μ_n(M_n)$ denote the unordered eigenvalues of $M_n$. We study the fluctuations of the partial linear eigenvalue statistics $$ \sum_{i=1}^{n-k} f(μ_i(M_n)) $$ as $n \rightarrow \infty$ for sufficiently nice test functions $f$. We consider both the case when $k$ is fixed and when $\min{k,n-k}$ tends to infinity with $n$.
We consider $n^2\times n^2$ real symmetric and hermitian matrices $M_n$, which are equal to sum of $m_n$ tensor products of vectors $X^μ=B(Y^μ\otimes Y^μ)$, $μ=1,\dots,m_n$, where $Y^μ$ are i.i.d. random vectors from $\mathbb R^n (\mathbb C^n)$ with zero mean and unit variance of components, and $B$ is an $n^2\times n^2$ positive definite non-random matrix. We prove that if $m_n/n^2\to c\in [0,+\infty)$ and the Normalized Counting Measure of eigenvalues of $BJB$, where $J$ is defined below, converges weakly, then the Normalized Counting Measure of eigenvalues of $M_n$ converges weakly in proba…
We consider two classical ensembles of the random matrix theory: the Wigner matrices and sample covariance matrices, and prove Central Limit Theorem for linear eigenvalue statistics under rather weak (comparing with results known before) conditions on the number of derivatives of the test functions and also on the number of the entries moments. Moreover, we develop a universal method which allows one to obtain automatically the bounds for the variance of differentiable test functions, if there is a bound for the variance of the trace of the resolvent of random matrix. The method is applicable …
Recently Johansson and Johnstone proved that the distribution of the (properly rescaled) largest principal component of the complex (real) Wishart matrix $ X^* \* X (X^t \*X) $ converges to the Tracy-Widom law as $ n, p $ (the dimensions of $ X $) tend to $ \infty $ in some ratio $ n/p \to γ>0. $ We extend these results in two directions. First of all, we prove that the joint distribution of the first, second, third, etc. eigenvalues of a Wishart matrix converges (after a proper rescaling) to the Tracy-Widom distribution. Second of all, we explain how the combinatorial machinery developed for …
We elucidate the problem of estimating large-dimensional covariance matrices in the presence of correlations between samples. To this end, we generalize the Marcenko-Pastur equation and the Ledoit-Peche shrinkage estimator using methods of random matrix theory and free probability. We develop an efficient algorithm that implements the corresponding analytic formulas, based on the Ledoit-Wolf kernel estimation technique. We also provide an associated open-source Python library, called "shrinkage", with a user-friendly API to assist in practical tasks of estimation of large covariance matrices. …
We present an analytic method to determine spectral properties of the covariance matrices constructed of correlated Wishart random matrices. The method gives, in the limit of large matrices, exact analytic relations between the spectral moments and the eigenvalue densities of the covariance matrices and their estimators. The results can be used in practice to extract information about the genuine correlations from the given experimental realization of random matrices.
Let $X_N$ be a $N\times N$ matrix whose entries are i.i.d. complex random variables with mean zero and variance $\frac{1}{N}$. We study the asymptotic spectral distribution of the eigenvalues of the covariance matrix $X_N^*X_N$ for $N\to\infty$. We prove that the empirical density of eigenvalues in an interval $[E,E+η]$ converges to the Marchenko-Pastur law locally on the optimal scale, $N η/\sqrt{E} \gg (\log N)^b$, and in any interval up to the hard edge, $\frac{(\log N)^b}{N^2}\lesssim E \leq 4-κ$, for any $κ>0$. As a consequence, we show the complete delocalization of the eigenvectors.
Consider an $N$ by $N$ matrix $X$ of complex entries with iid real and imaginary parts. We show that the local density of eigenvalues of $X^*X$ converges to the Marchenko-Pastur law on the optimal scale with probability $1$. We also obtain rigidity of the eigenvalues in the bulk and near both hard and soft edges. Here we avoid logarithmic and polynomial corrections by working directly with high powers of expectation of the Stieltjes transforms. We work under the assumption that the entries have a finite 4th moment and are truncated at $N^{1/4}$. In this work we simplify and adapt the methods f…
Wishart random matrix theory is of major importance for the analysis of correlated time series. The distribution of the smallest eigenvalue for Wishart correlation matrices is particularly interesting in many applications. In the complex and in the real case, we calculate it exactly for arbitrary empirical eigenvalues, i.e., for fully correlated Gaussian Wishart ensembles. To this end, we derive certain dualities of matrix models in ordinary space. We thereby completely avoid the otherwise unsurmountable problem of computing a highly non-trivial group integral. Our results are compact and much…
For the correlated Gaussian Wishart ensemble we compute the distribution of the smallest eigenvalue and a related gap probability.We obtain exact results for the complex (β=2) and for the real case (β=1). For a particular set of empirical correlation matrices we find universality in the spectral density, for both real and complex ensembles and all kinds of rectangularity. We calculate the asymptotic and universal results for the gap probability and the distribution of the smallest eigenvalue. We use the Supersymmetry method, in particular the generalized Hubbard-Stratonovich transformation and…
Using a character expansion method, we calculate exactly the eigenvalue density of random matrices of the form M^\dagger M where M is a complex matrix drawn from a normalized distribution P(M) ~ exp(-\Tr(A M B M^\dagger) with A and B positive definite (square) matrices of arbitrary dimensions. Such so-called ``correlated Wishart matrices'' occur in many fields ranging from information theory to multivariate analysis.
Data sets collected at different times and different observing points can possess correlations at different times $and$ at different positions. The doubly correlated Wishart model takes both into account. We calculate the eigenvalue density of the Wishart correlation matrices using supersymmetry. In the complex case we obtain a new closed form expression which we compare to previous results in the literature. In the more relevant and much more complicated real case we derive an expression for the density in terms of a fourfold integral. Finally, we calculate the density in the limit of large c…
The correlated Wishart model provides a standard tool for the analysis of correlations in a rich variety of systems. Although much is known for complex correlation matrices, the empirically much more important real case still poses substantial challenges. We put forward a new approach, which maps arbitrary statistical quantities, depending on invariants only, to invariant Hermitian matrix models. For completeness we also include the quaternion case and deal with all three cases in a unified way. As an important application, we study the statistics of the largest eigenvalue and its limiting dis…
We introduce a class of $M \times M$ sample covariance matrices $\mathcal Q$ which subsumes and generalizes several previous models. The associated population covariance matrix $Σ= \mathbb E \cal Q$ is assumed to differ from the identity by a matrix of bounded rank. All quantities except the rank of $Σ- I_M$ may depend on $M$ in an arbitrary fashion. We investigate the principal components, i.e.\ the top eigenvalues and eigenvectors, of $\mathcal Q$. We derive precise large deviation estimates on the generalized components $\langle \mathbf w, \boldsymbol ξ_i \rangle$ of the outlier and non-out…
The aim of this note is to provide a pedagogical survey of the recent works by the authors ( arXiv:1409.7548 and arXiv:1507.06013) concerning the local behavior of the eigenvalues of large complex correlated Wishart matrices at the edges and cusp points of the spectrum: Under quite general conditions, the eigenvalues fluctuations at a soft edge of the limiting spectrum, at the hard edge when it is present, or at a cusp point, are respectively described by mean of the Airy kernel, the Bessel kernel, or the Pearcey kernel. Moreover, the eigenvalues fluctuations at several soft edges are asymptot…
