About

One of the most fruitful points of contact between mathematics and theoretical computer science is the theory of expander graphs, which are sparse yet well-connected graphs. Over the past decade, this interaction has deepened via the theories of high-dimensional expansion, spectral independence, free probability, random matrices, and pseudorandomness. This workshop will present mini-courses on the subjects essential to this interaction, surveying recent breakthroughs with an eye toward future advances. The mini-courses will include problem-solving sessions.

This workshop is presented as a satellite conference of the International Congress of Mathematicians (ICM) 2026.

If you require special accommodation, please contact our access coordinator at simonsevents@berkeley.edu with as much advance notice as possible.

Chairs/Organizers