Related papers: Local Laws for Sparse Sample Covariance Matrices w…
In this paper, we shall investigate the almost sure limits of the largest and smallest eigenvalues of a quaternion sample covariance matrix. Suppose that $\mathbf X_n$ is a $p\times n$ matrix whose elements are independent quaternion…
Covariance estimation becomes challenging in the regime where the number p of variables outstrips the number n of samples available to construct the estimate. One way to circumvent this problem is to assume that the covariance matrix is…
We perform a smoothed analysis of the componentwise condition numbers for determinant computation, matrix inversion, and linear equations solving for sparse n times n matrices. The bounds we obtain for the ex- pectations of the logarithm of…
Lukacs type characterization of Marchenko--Pastur distribution in free probability is studied here. We prove that for free $\mathbb{X}$ and $\mathbb{Y}$ when conditional moments of order $1$ and $-1$ of…
In high-dimensions, many variable selection methods, such as the lasso, are often limited by excessive variability and rank deficiency of the sample covariance matrix. Covariance sparsity is a natural phenomenon in high-dimensional…
We consider large random matrices $X$ with centered, independent entries which have comparable but not necessarily identical variances. Girko's circular law asserts that the spectrum is supported in a disk and in case of identical…
We compute spectra of sample auto-covariance matrices of second order stationary stochastic processes. We look at a limit in which both the matrix dimension $N$ and the sample size $M$ used to define empirical averages diverge, with their…
This paper investigates global and local laws for sample covariance matrices with general growth rates of dimensions. The sample size $N$ and population dimension $M$ can have the same order in logarithm, which implies that their ratio…
Let $S_n=\frac{1}{n}X_nX_n^*$ where $X_n=\{X_{ij}\}$ is a $p\times n$ matrix with i.i.d. complex standardized entries having finite fourth moments. Let $Y_n(\mathbf {t}_1,\mathbf {t}_2,\sigma)=\sqrt{p}({\mathbf {x}}_n(\mathbf…
Testing covariance structure is of significant interest in many areas of statistical analysis and construction of compressed sensing matrices is an important problem in signal processing. Motivated by these applications, we study in this…
In subset selection we search for the best linear predictor that involves a small subset of variables. From a computational complexity viewpoint, subset selection is NP-hard and few classes are known to be solvable in polynomial time. Using…
This paper studies the limiting behavior of Tyler's M-estimator for the scatter matrix, in the regime that the number of samples $n$ and their dimension $p$ both go to infinity, and $p/n$ converges to a constant $y$ with $0<y<1$. We prove…
We prove that the local eigenvalue statistics in the bulk for complex random matrices with independent entries whose $r$-th absolute moment decays as $N^{-1-(r-2)\epsilon}$ for some $\epsilon>0$ are universal. This includes sparse matrices…
Bandeira et al. (2017) show that the eigenvalues of the Kendall correlation matrix of $n$ i.i.d. random vectors in $\mathbb{R}^p$ are asymptotically distributed like $1/3 + (2/3)Y_q$, where $Y_q$ has a Mar\v{c}enko-Pastur law with parameter…
The celebrated Mar\v{c}enko-Pastur law, that considers the asymptotic spectral density of random covariance matrices, has found a great number of applications in physics, biology, economics, engineering, among others. Here, using techniques…
We establish a general theory for subsampling network data generated by the sparse graphon model. In contrast to previous work for networks, we demonstrate validity under minimal assumptions; the main requirement is weak convergence of the…
Let $\mathbf{R}$ be the sample correlation matrix constructed from $\mathbf{X}\in \mathbb{R}^{p\times n}$, whose entries are independent and identically distributed random variables with mean zero and tail probability condition…
We establish local laws for sample covariance matrices $K = N^{-1}\sum_{i=1}^N \g_i\g_i^*$ where the random vectors $\g_1, \ldots, \g_N \in \R^n$ are independent with common covariance $\Sigma$. Previous work has largely focused on the…
The L1-regularized Gaussian maximum likelihood estimator (MLE) has been shown to have strong statistical guarantees in recovering a sparse inverse covariance matrix, or alternatively the underlying graph structure of a Gaussian Markov…
We place ourselves in the setting of high-dimensional statistical inference, where the number of variables $p$ in a data set of interest is of the same order of magnitude as the number of observations $n$. More formally, we study the…