Author:
Geske Mark X.,Godbole Anant P.,Schaffner Andrew A.,Skolnick Allison M.,Wallstrom Garrick L.
Abstract
Consider a stationary Markov chain with state space consisting of the ξ -letter alphabet set Λ= {a1, a2, ···, aξ }. We study the variables M=M(n, k) and N=N(n, k), defined, respectively, as the number of overlapping and non-overlapping occurrences of a fixed periodic k-letter word, and use the Stein–Chen method to obtain compound Poisson approximations for their distribution.
Publisher
Cambridge University Press (CUP)
Subject
Statistics, Probability and Uncertainty,General Mathematics,Statistics and Probability
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献