arXiv Analytics

Sign in

arXiv:1409.5396 [math.PR]AbstractReferencesReviewsResources

Spectral Analysis of Random Matrices with a Rank One Pattern of Variances

Victor M. Preciado, Mohammad Amin Rahimian

Published 2014-09-18Version 1

We prove that the empirical spectral distributions for a class of random matrices, characterized by independent zero-mean entries and rank one pattern of variances, converge with probability one to a deterministic distribution, which is uniquely characterized by its sequence of moments, and we provide explicit expressions for these limiting moments. We next proffer efficient optimization programs that allow us to upper and lower bound the expected spectral norm of this class of random matrices for any finite $n$ and the almost sure limit of the spectral norm as $n \to \infty$. Asymptotic properties of random matrices with nonidentical entries is a challenging problem in the theory of random matrices, and bounds on their spectral moments have significance in a miscellany of applications.

Related articles: Most relevant | Search more
arXiv:1106.4366 [math.PR] (Published 2011-06-22, updated 2013-04-18)
Large Deviations for Random Matrices
arXiv:1103.2801 [math.PR] (Published 2011-03-14, updated 2011-05-09)
Random matrices: Universal properties of eigenvectors
arXiv:0709.3995 [math.PR] (Published 2007-09-25, updated 2010-10-18)
The circular law for random matrices