Efficient computation of limit spectra of sample covariance matrices
DOI10.1142/S2010326315500197zbMath1330.65029arXiv1507.01649OpenAlexW2220487585MaRDI QIDQ3459159
Publication date: 30 December 2015
Published in: Random Matrices: Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.01649
Stieltjes transformeigenvaluemultivariate statisticsdata analysisrandom matrixsample covariance matrixempirical spectral distributionlimiting spectral distributionhigh-dimensional statistics
Multivariate distribution of statistics (62H10) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Random matrices (algebraic aspects) (15B52) Analysis of variance and covariance (ANOVA) (62J10)
Related Items
Uses Software
Cites Work
- The singular values and vectors of low rank perturbations of large rectangular random matrices
- Nonparametric estimate of spectral density functions of sample covariance matrices: a first step
- A note on a Marčenko-Pastur type theorem for time series
- Large complex correlated Wishart matrices: fluctuations and asymptotic independence at the edges
- The polynomial method for random matrices
- Spectral analysis of large dimensional random matrices
- Corrections to LRT on large-dimensional covariance matrix by RMT
- Analytic subordination theory of operator-valued free additive convolution and the solution of a general random matrix problem
- Optimal estimation of a large-dimensional covariance matrix under Stein's loss
- CLT for linear spectral statistics of large-dimensional sample covariance matrices.
- Analysis of the limiting spectral distribution of large dimensional random matrices
- Strong convergence of the empirical distribution of eigenvalues of large dimensional random matrices
- The random matrix regime of Maronna's M-estimator with elliptically distributed samples
- Spectrum estimation: a unified framework for covariance matrix estimation and PCA in large dimensions
- Deterministic equivalents for certain functionals of large random matrices
- A new approach to subordination results in free probability
- Random Matrix Methods for Wireless Communications
- The Optimal Hard Threshold for Singular Values is <inline-formula> <tex-math notation="TeX">\(4/\sqrt {3}\) </tex-math></inline-formula>
- OptShrink: An Algorithm for Improved Low-Rank Signal Matrix Denoising by Optimal, Data-Driven Singular Value Shrinkage
- Random Beamforming Over Quasi-Static and Fading Channels: A Deterministic Equivalent Approach
- Lectures on the Combinatorics of Free Probability
- Crystallization in Large Wireless Networks
- Large Dimensional Analysis of Robust M-Estimators of Covariance With Outliers
- Large Sample Covariance Matrices and High-Dimensional Data Analysis
- A Deterministic Equivalent for the Analysis of Correlated MIMO Multiple Access Channels
- An algorithm with guaranteed convergence for finding a zero of a function
- Random Matrix Theory and Wireless Communications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item