High-Dimensional Expansion (HDX) (Part 2) @SimonsInstitute
High-Dimensional Expansion (HDX) (Part 2)  @SimonsInstitute
Uploaded August 2026 | Updated November 2026, 5 days ago
Mitali Bafna (University of Washington)
https://simons.berkeley.edu/talks/mitali-bafna-university-washington-2026-08-26
ICM 2026 Satellite Conference: Spectral Theory, High-Dimensional Expansion, and Pseudorandomness

High-dimensional expansion (HDX) is a generalization of expansion in graphs to higher dimensions (i.e., hypergraphs). In recent years, HDXs have already seen a lot of amazing applications in areas such as error-correcting codes, bounding the mixing time of Markov chains and probabilistically checkable proofs (PCPs), and in explicit constructions of vertex expanders.

This mini-course aims to cover the basics of HDX and will follow this outline:
Lecture 1: We will start by defining the spectral notion of HDX, prove the trickling down theorem and define random walks on HDX.
Lectures 2 & 3: Show the Kaufman-Oppenheim construction of HDX. Time-permitting we will also cover an application to agreement testing, which is an important component of PCP constructions.
High-Dimensional Expansion (HDX) (Part 2)The Pseudorandomness Toolkit (Part 3)On constant T-depth circuitsSigned Rectified Flow: Negativity-Controlled GenerationDerandomizing Space-Bounded Computation (Part 2)Resonances on geometrically finite graphs and buildingsInference-Time Algorithms: A Theoretical Lens on Tractability and Error PropagationAligning Evaluation Incentives to Reduce HallucinationAI’s Models of the World, and Ours | Theoretically SpeakingATHENA: Steering Generative Models toward Better Visual ReasoningReliable Language GenerationStrong Convergence (Part I)
Simons Institute for the Theory of Computing |

High-Dimensional Expansion (HDX) (Part 2)

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER