Upcoming Events

I'll introduce the Burnside process: a family of finite state-space Markov chains that have proved surprisingly effective to simulate things such as contingency tables with fixed row and column sums, partitions of n (when n is 10^8) or more general objects (trees, graphs) defined up to symmetry…