Abstract
In this paper, we present a new upper bound for the spectral norm of symmetric random matrices with independent (but not necessarily identical) entries. Our results improve an earlier result of Füredi and Komlós.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon: Spectral techniques in graph algorithms, in: LATIN’98: theoretical informatics (Campinas, 1998), 206–215; Lecture Notes in Comput. Sci., 1380, Springer, Berlin, 1998.
N. Alon, M. Krivelevich and V. H. Vu: On the concentration of eigenvalues of random symmetric matrices, Israel J. Math. 131 (2002), 259–267.
Z. Füredi and J. Komlós: The eigenvalues of random symmetric matrices, Combinatorica 1(3) (1981), 233–241.
M. Krivelevich and V. H. Vu: Approximating the independence number and the chromatic number in expected polynomial time, J. Comb. Optim. 6(2) (2002), 143–155.
M. L. Mehta: Random matrices, Second edition, Academic Press, Inc., Boston, MA, 1991.
E. Wigner: On the distribution of the roots of certain symmetric matrices, The Annals of Mathematics 67 (1958), 325–327.
A. Soshnikov: Universality at the edge of the spectrum in Wigner random matrices, Comm. Math. Phys. 207(3) (1999), 697–733.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research supported by an NSF CAREER award and by an Alfred P. Sloan fellowship.