2013/10/09 by Olivier Guédon, Guédon, O., Anna Lytova +5
Mathematics · #Advanced Combinatorial Mathematics #FOS: Mathematics #Point processes and geometric inequalities #Probability (math.PR) #Random Matrices and Applications
paper · pdf · doi:10.48550/arxiv.1310.2506
openalex publication_date 2013/10/09 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
We consider n× n random matrices Mn=∑α=1mταyα⊗ yα, where τα∈ ℝ, \yα\α=1m are i.i.d. isotropic random vectors of ℝn, whose components are not necessarily independent. It was shown in arXiv:0710.1346 that if m,n→ ∞, m/n→ c∈ \lbrack 0,∞ ), the Normalized Counting Measures of \τα\α=1m converge weakly and \yα\α=1m are good (see corresponding definition), then the Normalized Counting Measures of eigenvalues of Mn converge weakly in probability to a non-random limit found in \citeMa-Pa:67. In this paper we indicate a subclass of good vectors, which we call 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.