Quicklists
Javascript must be enabled

Nayantara Bhatnagar : Subsequence Statistics in Random Mallows Permutations

root

81 Views

The longest increasing subsequence (LIS) of a uniformly random permutation is a well studied problem. Vershik-Kerov and Logan-Shepp first showed that asymptotically the typical length of the LIS is 2sqrt(n). This line of research culminated in the work of Baik-Deift-Johansson who related this length to the GUE Tracy-Widom distribution. We study the length of the LIS of random permutations drawn from the Mallows measure, introduced by Mallows in connection with ranking problems in statistics. We prove limit theorems for the LIS for different regimes of the parameter of the distribution. I will also describe some recent results on the longest common subsequence of independent Mallows permutations. Relevant background for the talk will be introduced as needed. Based on work with Ron Peled, Riddhi Basu and Ke Jin.

Please select playlist name from following

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.

0 Comments

Comments Disabled For This Video