Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
120 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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

The Central Limit Theorem for Linear Eigenvalue Statistics of the Sum of Independent Matrices of Rank One (1310.2506v2)

Published 9 Oct 2013 in math.PR

Abstract: We consider $n\times n$ random matrices $M_{n}=\sum_{\alpha =1}{m}{\tau {\alpha }}\mathbf{y}{\alpha }\otimes \mathbf{y}{\alpha }$, where $\tau _{\alpha }\in \mathbb{R}$, ${\mathbf{y}{\alpha }}{\alpha =1}{m}$ are i.i.d. isotropic random vectors of $\mathbb{R}n$, whose components are not necessarily independent. It was shown in arXiv:0710.1346 that if $m,n\rightarrow \infty$, $m/n\rightarrow c\in \lbrack 0,\infty )$, the Normalized Counting Measures of ${\tau _{\alpha }}{\alpha =1}{m}$ converge weakly and ${\mathbf{y}\alpha}{\alpha=1}m$ are \textit{good} (see corresponding definition), then the Normalized Counting Measures of eigenvalues of $M_{n}$ converge weakly in probability to a non-random limit found in \cite{Ma-Pa:67}. In this paper we indicate a subclass of good vectors, which we call \textit{very good} and for which the linear eigenvalue statistics of the corresponding matrices converge in distribution to the Gaussian law, i.e., the Central Limit Theorem is valid. An important example of good vectors, studied in arXiv:0710.1346 are the vectors with log-concave distribution. We discuss the conditions for them, guaranteeing the validity of the Central Limit Theorem for linear eigenvalue statistics of corresponding matrices.

Summary

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