Random Matrices Learning Seminar

Daniel Perales, Department of Pure Mathematics, University of Waterloo

"Random matrices, interlacing families of polynomials, and the expected characteristic polynomial"

In this session we will start by reviewing the interlacing result for the characteristic polynomial of A and A+vv*.  The goal of this meeting is to show an application of this result to the case when A is the adjacency matrix of a d-regular graph. We will follow the paper of Marcus, Spielman and Srivastava "Interlacing Families I" where they solve a conjecture due to Bilu and Linial concerning with bounding the maximum eigenvalue of +/- signings of edges of a d-regular graph.

NOTE: we would meet on a different room for this meeting only.

MC 5417