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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

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

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Thin Film Magnetic Talks Duxton Hotel Perth, Perth Drum Building or on Zoom https://zoom.us/j/6708259482?pwd=Qk03U3hxZWNJZUZpT2pVZnFtU2RRUT09

Other talks

Group Presentation 4 Title to be confirmed Discovery Investigations: Science, Empire and the Making of the British South Atlantic Gastroenterology and Acute Medicine Title to be confirmed Title to be confirmed
 

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