两两马尔可夫链整体得分矩的下界
Lower bounds for moments of global scores of pairwise Markov chains
摘要:
设$X_1,X_2,\ldots$和$Y_1,Y_2,\ldots$是两个随机序列,使得每个随机变量在有限集合$\mathbb{A}$中取值。我们考虑了一个全局相似性得分$L_n:=L(X_1,\ldots,X_n;Y_1,\ldots,Y_n)$,它测量了单词$(X_1,\ldots,X_n)$和$(Y_1,\ldots,Y_n)$的同源性(相关性)。这种分数的典型示例是最长公共子序列的长度。研究了二维过程$(X_1,Y_1),(X_2,Y_2),\ldots$是$\mathbb{A}\times \mathbb{A}$上的马氏链时中心绝对矩$E|L_n-EL_n|^r$的阶.这是一个非常一般的模型,涉及独立的马尔可夫链,隐马尔可夫模型,马尔可夫切换模型和更多。我们的主要结果建立了一个一般的条件,保证$E|L_n-EL_n|^r\asymp n^{r\over 2}$。我们还进行了模拟,表明条件的有效性。
英文摘要:
Let $X_1,X_2,\ldots$ and $Y_1,Y_2,\ldots$ be two random sequences so that every random variable takes values in a finite set $\mathbb{A}$. We consider a global similarity score $L_n:=L(X_1,\ldots,X_n;Y_1,\ldots,Y_n)$ that measures the homology (relatedness) of words $(X_1,\ldots,X_n)$ and $(Y_1,\ldots,Y_n)$. A typical example of such score is the length of the longest common subsequence. We study the order of central absolute moment $E|L_n-EL_n|^r$ in the case where two-dimensional process $(X_1,Y_1),(X_2,Y_2),\ldots$ is a Markov chain on $\mathbb{A}\times \mathbb{A}$. This is a very general model involving independent Markov chains, hidden Markov models, Markov switching models and many more. Our main result establishes a general condition that guarantees that $E|L_n-EL_n|^r\asymp n^{r\over 2}$. We also perform simulations indicating the validity of the condition.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。