On the length of the longest common subsequence of two independent Mallows permutations
| Author(s) | Jin, Ke | |
| Date Accessioned | 2018-01-25T13:14:15Z | |
| Date Available | 2018-01-25T13:14:15Z | |
| Publication Date | 2017 | |
| SWORD Update | 2017-09-06T19:35:09Z | |
| Abstract | The Mallows measure is a probability measure on Sn where the probability of a permutation π is proportional to q l(π) with q > 0 being a parameter and l(π) the number of inversions in π. We prove three weak laws of large numbers and a central limit theorem for the length of the longest common subsequences of two independent permutations drawn from the Mallows measure for different regimes of the parameter q. | en_US |
| Advisor | Bhatnagar, Nayantara | |
| Degree | Ph.D. | |
| Department | University of Delaware, Department of Mathematical Sciences | |
| Unique Identifier | 1020318451 | |
| URL | http://udspace.udel.edu/handle/19716/22612 | |
| Language | en | |
| Publisher | University of Delaware | en_US |
| URI | https://search.proquest.com/docview/1975366996?accountid=10457 | |
| Keywords | Applied sciences | en_US |
| Keywords | Longest common subsequence | en_US |
| Keywords | Longest increasing subsequence | en_US |
| Keywords | Mallows permutation | en_US |
| Title | On the length of the longest common subsequence of two independent Mallows permutations | en_US |
| Type | Thesis | en_US |