Session B5 - Random Matrices
July 13, 17:00 ~ 17:25 - Room B3
Some results on the eigenvectors of random symmetric matrices
Hong Kong University of Science and Technology, Hong Kong - email@example.com
Eigenvectors of large matrices and graphs play an essential role in combinatorics and theoretical computer science. For instance, many properties of a graph can be deduced or estimated from its eigenvectors. It is conjectured that an eigenvector of a random symmetric matrix behaves like a random vector uniformly distributed on the unit sphere. I will talk about some recent partial results toward confirming this conjecture.
Joint work with Sean O'Rourke (University of Colorado Boulder) and Van Vu (Yale University).