×

Waiting time distributions of simple and compound patterns in a sequence of \(r\)th order Markov dependent multi-state trials. (English) Zbl 1099.60050

Summary: Waiting time distributions of simple and compound runs and patterns have been studied and applied in various areas of statistics and applied probability. Most current results are derived under the assumption that the sequence is either independent and identically distributed or first order Markov dependent. We provide a comprehensive theoretical framework for obtaining waiting time distributions under the most general structure where the sequence consists of \(r\)th order \((r \geq 1)\) Markov dependent multi-state trials. We also show that the waiting time follows a generalized geometric distribution in terms of the essential transition probability matrix of the corresponding imbedded Markov chain. Further, we derive a large deviation approximation for the tail probability of the waiting time distribution based on the largest eigenvalue of the essential transition probability matrix. Numerical examples are given to illustrate the simplicity and efficiency of the theoretical results.

MSC:

60J20 Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
60J10 Markov chains (discrete-time Markov processes on discrete state spaces)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Aki S., Hirano K. (1999). Sooner and later waiting time problems for runs in Markov dependent bivariate trials. Annals of the Institute of Statistical Mathematics 51:17–29 · Zbl 0952.60071 · doi:10.1023/A:1003874900507
[2] Aki S., Hirano K. (2004). Waiting time problems for a two-dimensional pattern. Annals of the Institute of Statistical Mathematics 56:169–182 · Zbl 1057.60013 · doi:10.1007/BF02530530
[3] Balakrishnan N., Koutras M.V. (2002). Runs and scans with applications. John Wiley & Sons, New York · Zbl 0991.62087
[4] Feller W. (1968). An introduction to probability theory and its applications (Vol. I, 3rd ed.). Wiley, New York · Zbl 0155.23101
[5] Fu J.C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statistica Sinica 6:957–974 · Zbl 0857.60068
[6] Fu J.C., Koutras M.V. (1994). Distribution theory of runs: A Markov chain approach. Journal of the American Statistical Association 89:1050–1058 · Zbl 0806.60011 · doi:10.2307/2290933
[7] Fu J.C., Chang Y.M. (2002). On probability generating functions for waiting time distributions of compound patterns in a sequence of multistate trials. Journal of Applied Probability 39:70–80 · Zbl 1008.60031 · doi:10.1239/jap/1019737988
[8] Fu, J. C., Lou, W. Y. W. (2003). Distribution theory of runs and patterns and its applications: a finite Markov chain imbedding approach. World Scientific Publishing Co. · Zbl 1030.60063
[9] Han Q., Aki S. (2000a). Sooner and later waiting time problems based on a dependent sequence. Annals of the Institute of Statistical Mathematics 52:407–414 · Zbl 0972.60070 · doi:10.1023/A:1004182030590
[10] Han Q., Aki S. (2000b). Waiting time problems in a two-state Markov chain. Annals of the Institute of Statistical Mathematics 52:778–789 · Zbl 0989.60018 · doi:10.1023/A:1017537629251
[11] Han Q., Hirano K. (2003). Sooner and later waiting time problems for patterns in Markov dependent trials. Journal of Applied Probability 40:73–86 · Zbl 1023.60017 · doi:10.1239/jap/1044476828
[12] Koutras M.V. (1997). Waiting time distributions associated with runs of fixed length in two-state Markov chains. Annals of the Institute of Statistical Mathematics 49:123–139 · Zbl 0913.60019 · doi:10.1023/A:1003118807148
[13] Koutras M.V., Alexandrou V. (1995). Runs, scans and urn model distributions: a unified Markov chain approach. Annals of the Institute of Statistical Mathematics 47:743–766 · Zbl 0848.60021 · doi:10.1007/BF01856545
[14] Koutras M.V., Alexandrou V.A. (1997). Sooner waiting time problems in a sequence of trinary trials. Journal of Applied Probability 34:593–609 · Zbl 0891.60020 · doi:10.2307/3215087
[15] Lou W.Y.W. (1996). On runs and longest run tests: a method of finite Markov chain imbedding. Journal of the American Statistical Association 91:1595–1601 · Zbl 0881.62086 · doi:10.2307/2291585
[16] Seneta E. (1981). Non-negative matrices and Markov chains, 2nd edition. Springer-Verlag, Berlin Heidelberg New York · Zbl 0471.60001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.