Limiting laws of coherence of random matrices with applications to testing covariance structure and construction of compressed sensing matrices
Authors:
- T. Tony CaiTCT. Tony Cai
- Tiefeng JiangTJTiefeng Jiang
Open Access
- 1 June 2011
- journal article
- Published by Institute of Mathematical Statistics in The Annals of Statistics
- Vol. 39 (3) , 1496-1525
Abstract
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 paper the limiting laws of the coherence of an n × p random matrix in the high-dimensional setting where p can be much larger than n. Both the law of large numbers and the limiting distribution are derived. We then consider testing the bandedness of the covariance matrix of a high-dimensional Gaussian distribution which includes testing for independence as a special case. The limiting laws of the coherence of the data matrix play a critical role in the construction of the test. We also apply the asymptotic results to the construction of compressed sensing matrices.Keywords
All Related Versions
This publication has 38 references indexed in Scilit:
- The entries of circular orthogonal ensemblesJournal of Mathematical Physics, 2009
- Multivariate analysis and Jacobi ensembles: Largest eigenvalue, Tracy–Widom limits and rates of convergenceThe Annals of Statistics, 2008
- Sure Independence Screening for Ultrahigh Dimensional Feature SpaceJournal of the Royal Statistical Society Series B: Statistical Methodology, 2008
- Universality results for the largest eigenvalues of some sample covariance matrix ensemblesProbability Theory and Related Fields, 2008
- Asymptotic distribution of the largest off-diagonal entry of correlation matricesTransactions of the American Mathematical Society, 2007
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Maxima of entries of Haar distributed matricesProbability Theory and Related Fields, 2004
- Uncertainty principles and ideal atomic decompositionIEEE Transactions on Information Theory, 2001
- Two Moments Suffice for Poisson Approximations: The Chen-Stein MethodThe Annals of Probability, 1989