Asymptotic locations of bounded and unbounded eigenvalues of sample correlation matrices of certain factor models -- application to a components retention rule
Yohji Akama, Peng Tian

TL;DR
This paper analyzes the asymptotic behavior of eigenvalues of sample correlation matrices in factor models, extending results to unbounded cases, and discusses implications for component retention rules in high-dimensional data.
Contribution
It extends spectral analysis of correlation matrices to unbounded models and links eigenvalue behavior to component retention rules in high-dimensional factor models.
Findings
Eigenvalues of correlation matrices exhibit specific asymptotic behaviors.
Broken-stick rule effectively estimates the number of significant components.
Results apply to unbounded correlation matrices in high-dimensional settings.
Abstract
Let the dimension of data and the sample size tend to with . The spectral properties of a sample correlation matrix and a sample covariance matrix are asymptotically equal whenever the population correlation matrix is bounded (El Karoui 2009). We demonstrate this also for general linear models for unbounded , by examining the behavior of the singular values of multiplicatively perturbed matrices. By this, we establish: Given a factor model of an idiosyncratic noise variance and a rank- factor loading matrix which rows all have common Euclidean norm . Then, the th largest eigenvalues of satisfy almost surely: (1) diverges, (2) for the th largest singular value…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms
