The logarithmic law of sample correlation matrices
Yanpeng Li, Zhi Liu, Jiahui Xie, Wang Zhou

TL;DR
This paper establishes a universal logarithmic law for the determinant of sample correlation matrices derived from i.i.d. variables with specific tail conditions, revealing asymptotic normality as matrix dimensions grow.
Contribution
It introduces a new universal logarithmic law for the log-determinant of sample correlation matrices under broad tail conditions, extending previous results.
Findings
Asymptotic normality of log-determinant established
Universal law holds under broad tail conditions
Results applicable in near-singularity regimes
Abstract
Let be the sample correlation matrix constructed from , whose entries are independent and identically distributed random variables with mean zero and tail probability condition . We derive the universal logarithmic law for , \begin{equation*} \frac{\log \det \mathbf{R}-(p-n+1/2)\log (1-\frac{p-1}{n})+p-\frac{p}{n}}{\sqrt{-2\log (1-\frac{p-1}{n})-2\frac{p}{n}}}\stackrel{d}{\rightarrow} {N}(0,1), \end{equation*} if as . Moreover, under the near-singularity case for any , it is shown that the tail probability condition can be weakened to for any constant .
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
TopicsRandom Matrices and Applications · Quantum Information and Cryptography · Matrix Theory and Algorithms
