Extreme eigenvalues of sparse, heavy tailed random matrices

preprint2015arXivOpen access

Abstract

We study the statistics of the largest eigenvalues of p×pp \times p sample covariance matrices Σp,n=Mp,nMp,n∗Σ_{p,n} = M_{p,n}M_{p,n}^{*} when the entries of the p×np \times n matrix Mp,nM_{p,n} are sparse and have a distribution with tail t−αt^{-α}, α>0α>0. On average the number of nonzero entries of Mp,nM_{p,n} is of order nμ+1n^{μ+1}, 0≤μ≤10 \leq μ\leq 1. We prove that in the large nn limit, the largest eigenvalues are Poissonian if α<2(1+μ−1)α<2(1+μ^{-1}) and converge to a constant in the case α>2(1+μ−1)α>2(1+μ^{-1}). We also extend the results of Benaych-Georges and Peche [7] in the Hermitian case, removing restrictions on the number of nonzero entries of the matrix.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.