On the concentration of eigenvalues of random symmetric matrices
Michael Krivelevich, Van H. Vu
Abstract
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.
Create a lesson
Related papers
Phase transitions in non-Hermitian spherical integrals
Pierre Bousseyroux, Marc Potters
Factorization method for a clamped obstacle from near-field measurements via a far-field transformation
General Ozochiawaeze, Isaac Harris
Asymmetric phase transitions in random noncommutative geometries
Benedek Bukor, Masoud Khalkhali, Samuel Kováčik et al.
A Cumulative Framework for Solid Deformation
Lev Steinberg
Classification of pairs of second-order Hamiltonian operators and hydrodynamic type systems in six components
Giorgio Gubbiotti, Lambertus Van Geemen, Pierandrea Vergallo
Reconstructability of Inverse Problems under Symmetry: Separating Structural, Effective, and Physical Upper Bounds
Isshin Arai