# Sharp nonasymptotic bounds on the norm of random matrices with independent entries

@article{Bandeira2014SharpNB,
title={Sharp nonasymptotic bounds on the norm of random matrices with independent entries},
author={A. Bandeira and R. Handel},
journal={arXiv: Probability},
year={2014}
}
• Published 2014
• Mathematics
• arXiv: Probability
We obtain nonasymptotic bounds on the spectral norm of random matrices with independent entries that improve significantly on earlier results. If $X$ is the $n\times n$ symmetric matrix with $X_{ij}\sim N(0,b_{ij}^2)$, we show that $\mathbf{E}\Vert X\Vert \lesssim\max_i\sqrt{\sum_jb_{ij}^2}+\max _{ij}\vert b_{ij}\vert \sqrt{\log n}.$ This bound is optimal in the sense that a matching lower bound holds under mild assumptions, and the constants are sufficiently sharp that we can often capture… Expand
165 Citations

#### References

SHOWING 1-10 OF 30 REFERENCES
The eigenvalues of random symmetric matrices
• Mathematics, Computer Science
• Comb.
• 1981
• 613
• PDF
Lifts, Discrepancy and Nearly Optimal Spectral Gap*
• Mathematics, Computer Science
• Comb.
• 2006
• 173
The Expected Norm of Random Matrices
• Y. Seginer
• Computer Science, Mathematics
• Combinatorics, Probability and Computing
• 2000
• 91
• Highly Influential
• PDF
User-Friendly Tail Bounds for Sums of Random Matrices
• J. Tropp
• Mathematics, Computer Science
• Found. Comput. Math.
• 2012
• 1,240
• PDF
Concentration Inequalities - A Nonasymptotic Theory of Independence
• Mathematics, Computer Science
• Concentration Inequalities
• 2013
• 1,826
• PDF
Probability in Banach Spaces: Isoperimetry and Processes
• Mathematics
• 1991
• 1,504
• Highly Influential
Introduction to the non-asymptotic analysis of random matrices
• R. Vershynin
• Mathematics, Computer Science
• Compressed Sensing
• 2012
• 2,200
• PDF