Mallows model under the Ulam distance : a feasible combinatorial approach
暂无分享,去创建一个
[1] Miklós Bóna,et al. Combinatorics of permutations , 2022, SIGA.
[2] M. Fligner,et al. Distance Based Ranking Models , 1986 .
[3] P. Diaconis. Group representations in probability and statistics , 1988 .
[4] P. Diaconis,et al. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem , 1999 .
[5] J. Baik,et al. On the distribution of the length of the longest increasing subsequence of random permutations , 1998, math/9810105.
[6] H. Wilf,et al. A probabilistic proof of a formula for the number of Young tableaux of a given shape , 1979 .