Logarithmic law of large random correlation matrices
Nestor Parolya, Johannes Heiny, Dorota Kurowicka

TL;DR
This paper establishes a central limit theorem for the log determinant of large sample correlation matrices, providing explicit formulas for the mean and variance, with applications to testing uncorrelatedness in high-dimensional data.
Contribution
It derives a CLT for the log determinant of sample correlation matrices in high dimensions, including cases with unknown mean and heavy-tailed data, advancing random matrix theory and statistical testing.
Findings
CLT for log determinant of correlation matrices under high-dimensional asymptotics
Explicit formulas for asymptotic mean and variance
Robust test for uncorrelatedness applicable to heavy-tailed data
Abstract
Consider a random vector , where the elements of the vector are i.i.d. real-valued random variables with zero mean and finite fourth moment, and is a deterministic matrix such that the spectral norm of the population correlation matrix of is uniformly bounded. In this paper, we find that the log determinant of the sample correlation matrix based on a sample of size from the distribution of satisfies a CLT (central limit theorem) for and . Explicit formulas for the asymptotic mean and variance are provided. In case the mean of is unknown, we show that after recentering by the empirical mean the obtained CLT holds with a shift in the asymptotic mean. This result is of independent…
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 · Stochastic processes and statistical mechanics · Advanced Algebra and Geometry
