Igor Pak: Burnside processes on graphs and contingency tables
Time: Fri 2020-01-31 14.30 - 15.20
Lecturer: Igor Pak, University of California, UCLA
Burnside processes are defined by Jerrum to sample random orbits of the finite group action. In this talk I will show how Burnside processes allow fast sampling of random contingency tables, random graphs with fixed degree conditions, and other related combinatorial objects. I will also review their mixing time analysis, our empirical results, and present some probabilistic applications. Joint work with Sam Dittmer.