Skip to contentSkip to filters

We use cookies for analytics.

Optimal Spectral Gaps | Richard M. Karp Distinguished Lecture

Wednesday 15:30 Los Angeles (GMT-7)

Ended

Berkeley, United States

Abstract

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.

Topics

spectral gapsRandom Walksgraphsmanifoldsgroupspolynomial methodoptimalityoptimal gaps

More from Simons Institute for the Theory of Computing, UC Berkeley

All talks