Uploaded August 2026 | Updated November 2026, 1 day ago
Kuikui Liu (MIT)
https://simons.berkeley.edu/talks/kuikui-liu-mit-2026-08-28
ICM 2026 Satellite Conference: Spectral Theory, High-Dimensional Expansion, and Pseudorandomness
Markov chains are important stochastic processes used ubiquitously to algorithmically solve high-dimensional sampling problems. In this minicourse, we present a powerful framework called spectral independence for upper bounding the rate of convergence to stationarity for discrete Markov chains. This framework has intimate connections with the theory of high-dimensional expanders (HDX), and since been generalized significantly via the theory of localization schemes, which also encompasses Eldan's stochastic localization. This minicourse is structured as follows:
Lecture 1: We begin by stating basic examples and applications of the theory. We then define spectral independence and prove that it implies rapid mixing.
Lecture 2: We describe several classes techniques for establishing spectral independence, using the monomer-dimer model on matchings as a running example. Time permitting, we will sketch the theory of localization schemes.
Kuikui Liu (MIT)
https://simons.berkeley.edu/talks/kuikui-liu-mit-2026-08-28
ICM 2026 Satellite Conference: Spectral Theory, High-Dimensional Expansion, and Pseudorandomness
Markov chains are important stochastic processes used ubiquitously to algorithmically solve high-dimensional sampling problems. In this minicourse, we present a powerful framework called spectral independence for upper bounding the rate of convergence to stationarity for discrete Markov chains. This framework has intimate connections with the theory of high-dimensional expanders (HDX), and since been generalized significantly via the theory of localization schemes, which also encompasses Eldan's stochastic localization. This minicourse is structured as follows:
Lecture 1: We begin by stating basic examples and applications of the theory. We then define spectral independence and prove that it implies rapid mixing.
Lecture 2: We describe several classes techniques for establishing spectral independence, using the monomer-dimer model on matchings as a running example. Time permitting, we will sketch the theory of localization schemes.










