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 towards future advances. The mini-courses will include problem-solving sessions.

We plan to have lecture mini-courses on the following topics: Expander Graphs and Expanding Groups, High-Dimensional Expanders, Spectral Independence and Stochastic Localization, The Pseudorandomness Toolkit, Structure vs Randomness, Free Probability and Strong Convergence, Random Matrices.

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

Chairs/Organizers