Limit theorems for descents of Mallows permutations
Jimmy He (Stanford University)
Abstract: The Mallows measure on the symmetric group gives a way to generate random permutations which are more likely to be sorted than not. There has been a lot of recent work to try and understand the limiting properties of Mallows permutations. I'll discuss recent work on the joint distribution of descents, a statistic counting the number of "drops" in a permutation, and descents in its inverse, generalizing work of Chatterjee and Diaconis, and Vatutin. The proof is new even in the uniform case and uses Stein's method with a size-bias coupling as well as a regenerative representation of Mallows permutations.
mathematical physicscombinatoricsprobabilityrepresentation theorystatistics theory
Audience: researchers in the topic
Junior Integrable Probability Seminar
Series comments: The Junior Integrable Probability Seminar is a series of talks taking place online and involving young researchers working in Integrable Probability and related fields. Go to sites.google.com/view/junior-ips for zoom link and password for the talk a day before the seminar.
| Organizers: | Sayan Das*, Matteo Mucciconi |
| *contact for this listing |
