Speaker
Persi Diaconis (Stanford Math and Statistics)
Date
Thu, Oct 10 2024, 3:00pm
Location
384H

Look at a typical partition of N (uniform distribution). What does it 'look like'? How many singletons, parts of size k, how big is the largest part? AND how can we generate such a random partition, say when N = 10^6, to check theory against 'reality' Of course, there are many measures on partitions (induced from a random permutation, Plancherel, many, many others).In joint work with Nathan Tung, we have been studying measures arising from the commuting graph of S_n. Now wreath products and classical Polya theory arise. A lot works out, but there is still 'stuff to do' Even for the uniform distribution.