## The Annals of Applied Probability

### Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains

Torkel Erhardsson

#### Abstract

We consider the number of overlappingoccurrences up to a fixed time of one or several “rare ”patterns in a stationary finite-state Markov chain. We derive a bound for the total variation distance between the distribution of this quantity and a compound Poisson distribution, using general results on compound Poisson approximation for Markov chains by Erhardsson. If the state space is $\{0, 1\}$ and the pattern is a head run ($111 \dots 111$), the bound is completely explicit and improves on an earlier bound given by Geske, Godbole, Schaffner, Skolnick and Wallstrom. In general, the bound can be computed by solving five linear equation systems of dimension at most the number of states plus the sum of the lengths of the patterns. We also give approximations with error bounds for the distributions of the first occurrence time of a head run of fixed length and the longest head run occurringup to a fixed time. Finally, we consider the sojourn time in an “extreme” subset of the state space by a stationary birth–death chain and derive a bound for the total variation distance between the distribution of this quantity and a compound Poisson distribution.

#### Article information

Source
Ann. Appl. Probab., Volume 10, Number 2 (2000), 573-591.

Dates
First available in Project Euclid: 22 April 2002

https://projecteuclid.org/euclid.aoap/1019487356

Digital Object Identifier
doi:10.1214/aoap/1019487356

Mathematical Reviews number (MathSciNet)
MR1768222

Zentralblatt MATH identifier
1063.60007

#### Citation

Erhardsson, Torkel. Compound Poisson approximation for counts of rare patterns in Markov chains and extreme sojourns in birth-death chains. Ann. Appl. Probab. 10 (2000), no. 2, 573--591. doi:10.1214/aoap/1019487356. https://projecteuclid.org/euclid.aoap/1019487356

#### References

• Aldous, D. (1989). Probability Approximations via the Poisson Clumping Heuristic. Springer, New York.
• Barbour, A. D. (1997). Stein's method. In Encyclopedia of Statistical Science 1. Wiley, New York.
• Barbour, A. D., Chen, L. H. Y. and Loh, W.-L. (1992). Compound Poisson approximation for nonnegative random variables via Stein's method. Ann. Probab. 20 1843-1866.
• Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson approximation. Oxford Univ. Press.
• Berman, S. M. (1986). Extreme sojourns for random walks and birth-and-death processes. Comm. Statist. Stochastic Models 2 393-408.
• Durrett, R. (1991). Probability: Theory and Examples. Duxbury Press, Belmont, CA.
• Erhardsson, T. (1997). Compound Poisson approximation for Markov chains. Ph.D. thesis, Royal Institute of Technology, Stockholm.
• Erhardsson, T. (1999). Compound Poisson approximation for Markov chains usingStein's method. Ann. Probab. 27 565-596.
• Erhardsson, T. (2000). On stationary renewal reward processes where most rewards are zero. Probab. Theory Related Fields. To appear.
• Fill, J. A. (1991). Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1 62-87.
• Geske, M. X., Godbole, A. P., Schaffner, A. A., Skolnick, A. M. and Wallstrom, G. L. (1995). Compound Poisson approximations for word patterns under Markovian hypotheses. J. Appl. Probab. 32 877-892.
• Godbole, A. P. and Papastavridis, S. G., eds. (1994). Runs and Patterns in Probability: Selected Papers. Kluwer, Dordrecht.
• Gordon, L., Schilling, M. F. and Waterman, M. S. (1986). An extreme value theory for long head runs. Probab. Theory Related Fields 72 279-287.
• Roos, M. (1994). Stein-Chen method for compound Poisson approximation: the couplingapproach. In Probab. Theory Math. Statist. Proceedings of the Sixth Vilnius Conference 645-660.
• Roos, M. and Stark, D. (1996). Compound Poisson approximation of the number of visits to a small set in a Markov chain. Unpublished manuscript.
• Schbath, S. (1995). Compound Poisson approximation of word counts in DNA sequences. ESAIM Probab. Statist. 1 1-16.
• Serfozo, R. (1980). High-level exceedances of regenerative and semi-stationary processes. J. Appl. Probab. 17 423-431.
• Stefanov, V. T. and Pakes, A. G. (1997). Explicit distributional results in pattern formation. Ann. Appl. Probab. 7 666-678.
• Wang, Y. H. and Ji, S. (1995). Limit theorems for the number of occurrences of consecutive k successes in n Markovian trials. J. Appl. Probab. 32 727-735.