Advances in Applied Probability

Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials

James C. Fu and Brad C. Johnson

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text


Let Xn(Λ) be the number of nonoverlapping occurrences of a simple pattern Λ in a sequence of independent and identically distributed (i.i.d.) multistate trials. For fixed k, the exact tail probability 𝙿{Xn(Λ) < k} is difficult to compute and tends to 0 exponentially as n → ∞. In this paper we use the finite Markov chain imbedding technique and standard matrix theory results to obtain an approximation for this tail probability. The result is extended to compound patterns, Markov-dependent multistate trials, and overlapping occurrences of Λ. Numerical comparisons with Poisson and normal approximations are provided. Results indicate that the proposed approximations perform very well and do significantly better than the Poisson and normal approximations in many cases.

Article information

Adv. in Appl. Probab. Volume 41, Number 1 (2009), 292-308.

First available in Project Euclid: 21 April 2009

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 60E05: Distributions: general theory
Secondary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)

Finite Markov chain imbedding rate functions multistate trial


Fu, James C.; Johnson, Brad C. Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials. Adv. in Appl. Probab. 41 (2009), no. 1, 292--308. doi:10.1239/aap/1240319586.

Export citation


  • Arratia, R., Goldstein, L. and Gordon, L. (1990). Poisson approximation and the Chen--Stein method. Statist. Sci. 5, 403--434.
  • Barbour, A. D., Chryssaphinou, O. and Roos, M. (1996). Compound Poisson approximation in systems reliability. Naval Res. Logistics 43, 251--264.
  • Fu, J. C. and Koutras, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 1050--1058.
  • Fu, J. C. and Lou, W. Y. W. (2003). Distribution Theory of Runs and Patterns and Its Applications. World Scientific, River Edge, NJ.
  • Fu, J. C., Wang, L.and Lou, W. Y. W. (2003). On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials. J. Appl. Prob. 40, 346--360.
  • Godbole, A. P. (1991). Poisson approximations for runs and patterns of rare events. Adv. Appl. Prob. 23, 851--865.
  • Godbole, A. P. and Schaffner, A. A. (1993). Improved Poisson approximations for word patterns. Adv. Appl. Prob. 25, 334--347.
  • Mood, A. M. (1940). The distribution theory of runs. Ann. Math. Statist. 11, 367--392.
  • Riordan, J. (1958). An Introduction to Combinatorial Analysis. John Wiley, New York.
  • Wald, J. and Wolfowitz, J. (1940). On a test whether two samples are from the same population. Ann. Math. Statist. 11, 147--162.
  • Wishart, J. and Hirschfeld, H. O. (1936). A theorem concerning the distribution of joins between line segments. J. London Math. Soc. 11, 227--235.
  • Wolfowitz, J. (1943). On the theory of runs with some applications to quality control. Ann. Math. Statist. 14, 280--288.