My Favorite Expanders | Richard M. Karp Distinguished Lecture
Sep 29, 2026
Ryan O'Donnell
We use cookies for analytics.
Mathematics, Algebra, Computer Science and seminar by Ramon van Handel, Princeton University
Hosted by Simons Institute for the Theory of Computing, UC Berkeley
Wednesday 15:30 Los Angeles (GMT-7)
Ended
Ramon van Handel surveys recent progress on constructing graphs, manifolds and groups with optimal spectral gaps, which control how rapidly random walks explore a structure. The talk describes a polynomial method that proves optimality in new settings and connects these developments to longstanding questions about the prevalence of optimal gaps.