University of Cambridge > Talks.cam > Probability >  A new proof of Friedman’s second eigenvalue Theorem and its extensions

A new proof of Friedman’s second eigenvalue Theorem and its extensions

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Perla Sousi.

It was conjectured by Alon and proved by Friedman that a random d-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most 2 √ ( d − 1) + o(1) with probability tending to one as the size of the graph tends to infinity. We will discuss a new method to prove this statement and give some extensions to random lifts and related models.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity