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

  Browse A-Z

Log in

University Account External (via Google)

🔐 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

Faculty of Law, 10 West Road, Basement, SG 17 Selwyn College, Cambridge Lloyd Room, Christ’s College

Other talks

From Surrogate Solvers to PINNs and Beyond Classical Methods Title to be confirmed Title and abstract tba Group Work Morning Break Formalising mathematics and spectral geometry in Lean
 

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