# Random matrix perturbations

## Speaker:

## Speaker Link:

## Institution:

## Time:

## Host:

## Location:

Computing the eigenvalues and eigenvectors of a large matrix is a basic task in high dimensional data analysis with many applications in computer science and statistics. In practice, however, data is often perturbed by noise. A natural question is the following: How much does a small perturbation to the matrix change the eigenvalues and eigenvectors? In this talk, I will consider the case where the perturbation is random. I will discuss perturbation results for the eigenvalues and eigenvectors as well as for the singular values and singular vectors. This talk is based on joint work with Van Vu, Ke Wang, and Philip Matchett Wood.