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 limiting properties of Mallows permutations. I'll present work in progress on a central limit theorem for two-sided descents, a statistic counting the number of "drops" in a permutation and its...