CMU Campus
Department of         Mathematical Sciences
Events People Colloquia and Seminars Conferences Centers Positions Areas of Research About the Department Alumni
Math Colloquium
Peter Winkler
Dartmouth
Title: Permutons

Abstract: What do permutations of 1 through n, for large n, look like? For example, how can we generate a random permutation that inverts a third of its pairs?

How many such permutations are there?

Permutons are doubly-stochastic measures; they are exactly the limit objects for large permutations, in the appropriate topology. By finding permutons that maximize entropy, we (with Rick Kenyon, Dan Kral and Charles Radin) are able in some cases to count and describe permutations with specified pattern densities. We'll show how permutons arise in several situations, and try to explain why they work, in some senses, better than graphons do for graphs.

Date: Tuesday, December 1, 2015
Time: 4:30 pm
Location: Wean Hall 7218
Submitted by:  Pego
Note: Refreshments at 4:00 pm, Wean Hall 6220.