On the Order of the Central Moments of the Length of the Longest Common Subsequences in Random Words

被引：7
|
作者：
Houdre, Christian [1 ]
Ma, Jinyong [1 ]
机构：
[1] Georgia Inst Technol, Sch Math, Atlanta, GA 30332 USA
来源：
HIGH DIMENSIONAL PROBABILITY VII: THE CARGESE VOLUME | 2016年 / 71卷
关键词：
Burkholder inequality; Efron-Stein inequality; Last passage percolation; Longest common subsequence; r-th central moment; VARIANCE;
D O I：
10.1007/978-3-319-40519-3_5
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
We investigate the order of the r-th, 1 <= r < infinity, central moment of the length of the longest common subsequences of two independent random words of size n whose letters are identically distributed and independently drawn from a finite alphabet. When all but one of the letters are drawn with small probabilities, which depend on the size of the alphabet, a lower bound is shown to be of order n(r/2). This result complements a generic upper bound also of order n(r/2).
引用
收藏
页码：105 / 136
页数：32
相关论文
共 50 条
12345