Javascript must be enabled

# Matthew Junge : The inevitable Ewens distribution

Consider the following three questions: How many uniformly random permutations are needed to invariably generate the symmetric group? How many iterations of a Monte-Carlo algorithm are needed to decide whether a polynomial in Z[x] splits? How many sumsets formed from independent Poisson multistep are needed to have a chance of an empty intersection? And their answer: Four. What is so special about four? Not much. These all are special cases of the ubiquitous Ewens sampling formula. Come and find out why.

**Category**: Graduate/Faculty Seminar**Duration**: 01:14:42**Date**: September 19, 2016 at 11:55 AM**Views**: 107-
**Tags:**seminar, Graduate/faculty Seminar

## 0 Comments