ACO The ACO Seminar (2021–2022)

February 24, 3:30pm, Wean 8220
Will Perkins, University of Illinois at Chicago
Sampling, counting, and local central limit theorems

Abstract:

I will describe how local central limit theorems (and Fourier-analytic proofs of local central limit theorems) can be used to design fast sampling algorithms and deterministic approximate counting algorithms for the number of independent sets and matchings of a given size in bounded degree graphs. Joint work with Vishesh Jain, Ashwin Sah, and Mehtaab Sawhney.

Back to the ACO home page Back to the ACO Seminar schedule