Article contents
Compound Poisson approximations for word patterns under Markovian hypotheses
Published online by Cambridge University Press: 14 July 2016
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.
Keywords
MSC classification
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1995
Footnotes
This research was supported by U.S. National Science Foundation REU Grants DMS-9100829 and DMS-9200409.
References
Arratia, R., Goldstein, L. and Gordon, L. (1989) Two moments suffice for Poisson approximation: the Chen-Stein method. Ann. Prob.
17, 9–25.Google Scholar
Arratia, R., Goldstein, L. and Gordon, L. (1990) Poisson approximation and the Chen-Stein method. Statist. Sci.
5, 403–424.Google Scholar
Barbour, A., Chen, L. and Loh, W.-L. (1992a) Compound Poisson approximation for nonnegative random variables via Stein's method. Ann. Prob.
20, 1843–1866.Google Scholar
Barbour, A., Holst, L. and Janson, S. (1992b) Poisson Approximation.
Oxford University Press.Google Scholar
Böker, F. and Serfozo, R. (1983) Ordered thinnings of point processes and random measures. Stoch. Proc. Appl.
15, 113–132.Google Scholar
Brown, T. (1983) Some Poisson approximations using compensators. Ann. Prob.
11, 726–744.CrossRefGoogle Scholar
Chrysaphinou, O. and Papastavridis, S. (1988) A limit theorem on the number of overlapping occurrences of a pattern in a sequence of independent trials. Prob. Theory Rel. Fields
79, 129–143.CrossRefGoogle Scholar
Chrysaphinou, O. and Papastavridis, S. (1990) The occurrence of sequence patterns in repeated dependent experiments. Theory Prob. Appl.
35, 145–152.Google Scholar
Diaconis, P. and Stroock, D. (1990) Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob.
1, 36–61.Google Scholar
Fill, J. (1991) Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Prob.
1, 62–87.Google Scholar
Gani, J. (1982) On the probability generating function of the sum of Markov-Bernoulli random variables. J. Appl. Prob.
19A, 321–326.Google Scholar
Godbole, A. (1991) Poisson approximations for runs and patterns of rare events. Adv. Appl. Prob.
23, 851–865.Google Scholar
Godbole, A. and Schaffner, A. (1993) Improved Poisson approximations for word patterns. Adv. Appl. Prob.
25, 334–347.CrossRefGoogle Scholar
Roos, M. (1994) Stein's method for compound Poisson approximation: the local approach. Ann. Appl. Prob.
4, 1177–1187.Google Scholar
Serfozo, R. (1986) Compound Poisson approximations for sums of random variables. Ann. Prob.
14, 1391–1398.Google Scholar
Wang, Y. (1981) On the limit of the Markov-binomial distribution. J. Appl. Prob.
18, 937–942.Google Scholar
- 28
- Cited by