Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-27T12:30:31.206Z Has data issue: false hasContentIssue false
  • English
  • Français

Waiting times for patterns in a sequence of multistate trials

Part of: Distribution theory - Probability Markov processes

Published online by Cambridge University Press:  14 July 2016

Demetrios L. Antzoulakos
Demetrios L. Antzoulakos*
Affiliation:
University of Piraeus
*
∗ Postal address: Department of Statistics and Insurance Science, University of Piraeus, 18534 Piraeus, Greece. Email address: dantz@unipi.gr
Get access Rights & Permissions [Opens in a new window]

Abstract

Let Xn, n ≥ 1 be a sequence of trials taking values in a given set A, let ∊ be a pattern (simple or compound), and let Xr,∊ be a random variable denoting the waiting time for the rth occurrence of ∊. In the present article a finite Markov chain imbedding method is developed for the study of Xr,∊ in the case of the non-overlapping and overlapping way of counting runs and patterns. Several extensions and generalizations are also discussed.

Keywords

Markov chainmultistate trialspatternwaiting time distributionsooner and later waiting time problemsreliability

MSC classification

Primary: 60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Secondary: 60E05: Distributions
Type
Research Papers
Information
Journal of Applied Probability , Volume 38 , Issue 2 , June 2001 , pp. 508 - 518
Copyright
Copyright © Applied Probability Trust 2001 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aki, S., and Hirano, K. (1993). Discrete distributions related to succession events in a two-state Markov chain. In Statistical Science and Data Analysis, eds Matusita, K. et al. VSP, Amsterdam, pp. 467–474.Google Scholar
Antzoulakos, D. L. (1999). On waiting time problems associated with runs in Markov dependent trials. Ann. Inst. Statist. Math. 51, 323–330.Google Scholar
Balasubramanian, K., Viveros, R., and Balakrishnan, K. (1993). Sooner and later waiting time problems for Markovian Bernoulli trials. Statist. Prob. Lett. 18, 153–161.Google Scholar
Banjevic, D. (1994). Pattern recognition in Markov chains. In Runs and Patterns in Probability: Selected Papers, eds Godbole, A. P. and Papasravridis, S. G. Kluwer, Dordrecht, pp. 213–230.Google Scholar
Breen, S., Waterman, M. S., and Zhang, N. (1985). Renewal theory for several patterns. J. Appl. Prob. 22, 228–234.CrossRefGoogle Scholar
Ebneshahrashoob, M., and Sobel, M. (1990). Sooner and later waiting time problems for Bernoulli trials: frequency and run quotas. Statist. Prob. Lett. 9, 5–11.Google Scholar
Feller, W. (1968). An Introduction to Probability Theory and its Applications, Vol. I, 3rd edn. John Wiley, New York.Google Scholar
Fu, J. C. (1986). Reliability of large consecutive-k-out-of-n:F systems with k – 1-step Markov dependence. IEEE Trans. Rel. 35, 602–606.Google Scholar
Fu, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statist. Sinica. 6, 957–974.Google Scholar
Fu, J. C., and Koutras, M. V. (1994). Distribution theory of runs: a Markov chain approach. J. Amer. Statist. Assoc. 89, 1050–1058.CrossRefGoogle Scholar
Guibas, L. J., and Odlyzko, A. M. (1981). String overlaps, pattern matching, and nontransitive games. J. Combin. Theory A 30, 183–208.CrossRefGoogle Scholar
Koutras, M. V. (1996a). On a Markov chain approach for the study of reliability structures. J. Appl. Prob. 33, 357–367.CrossRefGoogle Scholar
Koutras, M. V. (1996b). On a waiting time distribution in a sequence of Bernoulli trials. Ann. Inst. Statist. Math. 48, 789–806.Google Scholar
Koutras, M. V. (1997). Waiting time distributions associated with runs of fixed length in two-state Markov chains. Ann. Inst. Statist. Math. 49, 123–139.Google Scholar
Koutras, M. V., and Alexandrou, V. A. (1997). Sooner waiting time problems in a sequence of trinary trials. J. Appl. Prob. 34, 593–609.Google Scholar
Li, S. R. (1980). A martingale approach to the study of occurrence of sequence patterns in repeated experiments. Ann. Prob. 8, 1171–1176.Google Scholar
Ling, K. D. (1989). A new class of negative binomial distributions of order k . Statist. Prob. Lett. 7, 371–376.Google Scholar
Mohanty, S. G. (1994). Success runs of length k in Markov dependent trials. Ann. Inst. Statist. Math. 46, 777–796.CrossRefGoogle Scholar
Panjer, H., and Willmot, G. (1992). Insurance Risk Models. Society of Actuaries, Chicago.Google Scholar
Philippou, A. N. (1984). The negative binomial distribution of order k and some of its properties. Biometrical J. 26, 789–794.Google Scholar
Schwager, S. J. (1983). Run probabilities in sequences of Markov-dependent trials. J. Amer. Statist. Assoc. 78, 168–175.CrossRefGoogle Scholar
Shmueli, G., and Cohen, A. (2000). Run-related probability functions applied to sampling inspection. Technometrics 42, 188–202.Google Scholar