Logarithmic law of large random correlation matrices

From MaRDI portal
Publication:6178564

DOI10.3150/23-BEJ1600arXiv2103.13900MaRDI QIDQ6178564FDOQ6178564


Authors: Nestor Parolya, Johannes Heiny, D. Kurowicka Edit this on Wikidata


Publication date: 16 January 2024

Published in: Bernoulli (Search for Journal in Brave)

Abstract: Consider a random vector mathbfy=mathbfSigma1/2mathbfx, where the p elements of the vector mathbfx are i.i.d. real-valued random variables with zero mean and finite fourth moment, and mathbfSigma1/2 is a deterministic pimesp matrix such that the spectral norm of the population correlation matrix mathbfR of mathbfy is uniformly bounded. In this paper, we find that the log determinant of the sample correlation matrix hatmathbfR based on a sample of size n from the distribution of mathbfy satisfies a CLT (central limit theorem) for p/nogammain(0,1] and pleqn. Explicit formulas for the asymptotic mean and variance are provided. In case the mean of mathbfy 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 interest in both large dimensional random matrix theory and high-dimensional statistical literature of large sample correlation matrices for non-normal data. At last, the obtained findings are applied for testing of uncorrelatedness of p random variables. Surprisingly, in the null case mathbfR=mathbfI, the test statistic becomes completely pivotal and the extensive simulations show that the obtained CLT also holds if the moments of order four do not exist at all, which conjectures a promising and robust test statistic for heavy-tailed high-dimensional data.


Full work available at URL: https://arxiv.org/abs/2103.13900







Cites Work


Cited In (2)





This page was built for publication: Logarithmic law of large random correlation matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178564)