On the Log Determinant of Sample Correlation Matrices under Gaussianity
Hongru Zhao
Abstract
We prove a central limit theorem for the log determinant of a Gaussian Pearson sample correlation matrix as the dimension diverges. Only two conditions are imposed: the population correlation matrix is positive definite, and the sample degrees of freedom are at least the dimension. Both are necessary for the ordinary log determinant to be finite. To the best of our knowledge, no previous central limit theorem covers this full nonsingular domain. It covers every aspect ratio from dilute growth to the square hard edge. No uniform lower or upper bound is imposed on the eigenvalues of the population correlation matrices: the smallest may approach zero and the largest may diverge. The proof develops a coordinatewise Wiener chaos reduction for the random diagonal normalization and combines it with an exact Wishart transform comparison. Geometrically, the statistic is twice the log volume of a random parallelotope spanned by standardized Gaussian coordinate vectors.
Create a lesson
Related papers
Minimax optimality for sequential gradient-free minimization of smooth functions and their derivatives
Théo Paquier, Alexandre B Tsybakov, François Portier et al.
Randomization Inference with Concentration Inequalities
Tobias Freidling
On the continuity of the Tukey depth function for fuzzy data
Luis González-De La Fuente, Alicia Nieto-Reyes, Pedro Terán
Recursive-Head Geometry and Order-Free Efficient Inference in Finite-State Nested Markov Models
Haoyu Wei
Finite-Sample Hausdorff Bounds and Hadamard Sensitivity for Regressions with MNAR Covariates
Hugo Dunias
Semiparametric Efficient Inference under Non-Informative Complex Survey Designs
Hiroki Chiba, Kosuke Morikawa