Skip to main content

Igor Pak: Burnside processes on graphs and contingency tables

Time: Fri 2020-01-31 14.30 - 15.20

Location: Institut Mittag-Leffler, Seminar Hall Kuskvillan

Lecturer: Igor Pak, University of California, UCLA

Abstract

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.

Page responsible:webmaster@math.kth.se
Belongs to: Department of Mathematics
Last changed: Jan 24, 2020