Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Entropic CLT and phase transition in high-dimensional Wishart matrices (1509.03258v3)

Published 10 Sep 2015 in math.PR, cs.IT, math.FA, math.IT, math.ST, and stat.TH

Abstract: We consider high dimensional Wishart matrices $\mathbb{X} \mathbb{X}{\top}$ where the entries of $\mathbb{X} \in {\mathbb{R}{n \times d}}$ are i.i.d. from a log-concave distribution. We prove an information theoretic phase transition: such matrices are close in total variation distance to the corresponding Gaussian ensemble if and only if $d$ is much larger than $n3$. Our proof is entropy-based, making use of the chain rule for relative entropy along with the recursive structure in the definition of the Wishart ensemble. The proof crucially relies on the well known relation between Fisher information and entropy, a variational representation for Fisher information, concentration bounds for the spectral norm of a random matrix, and certain small ball probability estimates for log-concave measures.

Citations (40)

Summary

We haven't generated a summary for this paper yet.