Some strong limit theorems for the largest entries of sample correlation matrices
arXiv:math/0603334 · doi:10.1214/105051605000000773
Abstract
Let be an array of i.i.d. random variables and let be a sequence of positive integers such that is bounded away from 0 and . For and where denotes the Pearson correlation coefficient between and , the limit laws (i) a.s. , (ii) a.s. , (iii) a.s. and (iv) a.s. are shown to hold under optimal sets of conditions. These results follow from some general theorems proved for arrays of i.i.d. two-dimensional random vectors. The converses of the limit laws (i) and (iii) are also established. The current work was inspired by Jiang's study of the asymptotic behavior of the largest entries of sample correlation matrices.
Published at http://dx.doi.org/10.1214/105051605000000773 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (1)
Cited by in corpus (11)
- Distributions of Angles in Random Packing on Spheres
- Necessary and sufficient conditions for the asymptotic distributions of coherence of ultra-high dimensional random matrices
- Gaussian Approximation for High Dimensional Time Series
- Central Limit Theorems for Classical Likelihood Ratio Tests for High-Dimensional Normal Distributions
- Limiting behavior of largest entry of random tensor constructed by high-dimensional data
- On Jiang's asymptotic distribution of the largest entry of a sample correlation matrix
- Large Scale Correlation Screening
- Phase Transition in Limiting Distributions of Coherence of High-Dimensional Random Matrices
- On convergence of the sample correlation matrices in high-dimensional data
- Coherence of high-dimensional random matrices in a Gaussian case : application of the Chen-Stein method
- Limiting Laws of Coherence of Random Matrices with Applications to Testing Covariance Structure and Construction of Compressed Sensing Matrices