On the Distribution of the Length of the Longest Increasing Subsequence in a Random Permutation

被引:0
|
作者
James C. Fu
Yu-Fei Hsieh
机构
[1] University of Manitoba,Department of Statistics
来源
Methodology and Computing in Applied Probability | 2015年 / 17卷
关键词
Longest increasing subsequence; Insertion procedure; Finite Markov chain imbedding; Random permutation; 60E05; 60J10;
D O I
暂无
中图分类号
学科分类号
摘要
The distribution of the longest increasing subsequence in a random permutation has attracted many researchers in statistics, computer sciences and mathematics. There are considerable manuscripts studying the distribution especially for large n. In this short manuscript, we provide a simple probabilistic approach to obtain the exact distribution of the length of the longest increasing subsequence of a random permutation, based on the insertion procedure and the finite Markov chain imbedding technique.
引用
收藏
页码:489 / 496
页数:7
相关论文
共 50 条