Concentration of norms and eigenvalues of random matrices

Abstract

We prove concentration results for ${\ell }_p^n$ operator norms of rectangular random matrices and eigenvalues of self-adjoint random matrices. The random matrices we consider have bounded entries which are independent, up to a possible self-adjointness constraint. Our results are based on an isoperimetric inequality for product spaces due to Talagrand.

15 pages; AMS-LaTeX; updated one reference

References in corpus (3)

• Level-Spacing Distributions and the Airy Kernel
• On Orthogonal and Symplectic Matrix Ensembles
• Universality at the edge of the spectrum in Wigner random matrices

Cited by in corpus (17)

• Some results on random circulant matrices
• Random matrices, non-backtracking walks, and orthogonal polynomials
• Random matrices: Localization of the eigenvalues and the necessity of four moments
• Singular value decomposition of large random matrices (for two-way classification of microarrays)
• Complexity is not Enough for Randomness
• Random matrices: Sharp concentration of eigenvalues
• Outliers in the spectrum of iid matrices with bounded rank perturbations
• Separating populations with wide data: A spectral analysis
• The spectra of random abelian G-circulant matrices
• On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems
• Matrix Infinitely Divisible Series: Tail Inequalities and Their Applications
• Concentration Inequalities in Locally Dependent Spaces
• Spectral Moments of Random Matrices with a Rank-One Pattern of Variances
• On $r$-to-$p$ norms of random matrices with nonnegative entries: Asymptotic normality and ${\ell }_{\infty }$-bounds for the maximizer
• A case where a spindly two-layer linear network whips any neural network with a fully connected input layer
• Entropy method for the left tail
• Concentration of the empirical spectral distribution of random matrices with dependent entries