On the concentration of eigenvalues of random symmetric matrices
  We prove that few largest (and most important) eigenvalues of random symmetric matrices of various kinds are very strongly concentrated. This strong concentration enables us to compute the means of these eigenvalues with high precision. Our approach uses Talagrand's inequality and is very different from standard approaches. 
Michael Krivelevich and Van H. Vu