arXiv Analytics

Sign in

arXiv:1703.07691 [math.PR]AbstractReferencesReviewsResources

A Note on the Expected Length of the Longest Common Subsequences of two i.i.d. Random Permutations

Christian Houdré, Chen Xu

Published 2017-03-22Version 1

The minimal expected length of the Longest Common Subsequences ($LCSs$) of two i.i.d.$\ $random permutations of the symmetric group is not attained in the uniform case.

Comments: 11 pages
Categories: math.PR
Subjects: 05A05, 60C05
Related articles: Most relevant | Search more
arXiv:2206.04660 [math.PR] (Published 2022-06-09)
Large deviation principle for random permutations
arXiv:1812.09552 [math.PR] (Published 2018-12-22)
On the Variance of the Length of the Longest Common Subsequences in Random Words With an Omitted Letter
arXiv:1412.3781 [math.PR] (Published 2014-12-11)
Four Random Permutations Conjugated by an Adversary Generate $S_n$ with High Probability

Links

Toolbox