Approximating the extreme right-hand tail probability for the distribution of the number of patterns in a sequence of multi-state trials

The distribution of Xn(Λ)Xn(Λ), the number of occurrences of a specified pattern ΛΛ of length ℓℓ in a sequence of multi-state trials {Xi}i=1n, is of vital importance in statistical inference and applied probability. Fu and Johnson [2009. Approximate probabilities for runs and patterns in i.i.d. and Markov dependent multi-state trials. Advances in Applied Probability 41(1), 292–308] introduced a finite Markov chain imbedding (FMCI) approximation for the left-hand tail probability P{Xn(Λ)=k}P{Xn(Λ)=k}. They show that, for fixed k  , the ratio between the exact and approximate probabilities tend to one as n→∞n→∞ and also show that the FMCI approximation can perform much better than normal or Poisson approximations. However, if k is a function of n  , and right-hand tail probabilities are of interest, then the normal and Poisson approximations perform extremely poorly. The performance of the FMCI approximation also degrades in this region. In this paper we examine approximations for extreme right-hand tail probabilities, such as P{Xn(Λ)≥n/ℓ−x}P{Xn(Λ)≥n/ℓ−x}, and large deviation probabilities of the form P{Xn(Λ)≥EXn(Λ)+nx}P{Xn(Λ)≥EXn(Λ)+nx}. Theoretical and numerical results show that the proposed approximations perform very well.

► We discuss approximations for pattern counts in sequences of multi-state trials. ► We examine approximations for extreme right-hand tail probabilities. ► We make use of finite Markov chain imbedding and the principle of large deviations. ► We provide comparisons with Gaussian and Poisson approximation methods.