Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-26T20:16:58.607Z Has data issue: false hasContentIssue false
  • English
  • Français

Waiting time distributions of competing patterns in higher-order Markovian sequences

Part of: Markov processes Distribution theory - Probability

Published online by Cambridge University Press:  14 July 2016

John A. D. Aston  and
Donald E. K. Martin
John A. D. Aston*
Affiliation:
Academia Sinica, Taiwan
Donald E. K. Martin*
Affiliation:
Howard University and U.S. Census Bureau
*
∗Postal address: Institute of Statistical Science, Academia Sinica, 128 Academia Road, Sec. 2, Taipei, 115, Taiwan, Republic of China. Email address: [email protected]
∗∗Postal address: Department of Mathematics, Howard University, Washington, DC 20059, USA. Email address: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Competing patterns are compound patterns that compete to be the first to occur pattern-specific numbers of times. They represent a generalisation of the sooner waiting time problem and of start-up demonstration tests with both acceptance and rejection criteria. Through the use of finite Markov chain imbedding, the waiting time distribution of competing patterns in multistate trials that are Markovian of a general order is derived. Also obtained are probabilities that each particular competing pattern will be the first to occur its respective prescribed number of times, both in finite time and in the limit.

Keywords

Multistate trialsfinite Markov chain imbeddingsooner waiting time distributionstart-up demonstration testcompeting compound patterns

MSC classification

Primary: 60E05: Distributions
Secondary: 60J05: Discrete-time Markov processes on general state spaces
Type
Research Papers
Information
Journal of Applied Probability , Volume 42 , Issue 4 , December 2005 , pp. 977 - 988
Copyright
© Applied Probability Trust 2005 

References

Aki, S. and Hirano, K. (1999). Sooner and later waiting time problems for runs in Markov dependent bivariate trials. Ann. Inst. Statist. Math. 51, 17–29.Google Scholar
Balakrishnan, N. and Chan, P. S. (2000). Start-up demonstration tests with rejection of units upon observing d failures. Ann. Inst. Statist. Math. 52, 184–196.Google Scholar
Balasubramanian, K., Viveros, R. and Balakrishnan, N. (1993). Sooner and later waiting time problems for Markovian Bernoulli trials. Statist. Prob. Lett. 18, 153–161.Google 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
Fu, J. C. (1996). Distribution theory of runs and patterns associated with a sequence of multi-state trials. Statistica 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.Google Scholar
Hahn, G. J. and Gage, J. B. (1983). Evaluation of a start-up demonstration test. J. Quality Tech. 15, 103–105.Google Scholar
Han, Q. and Hirano, K. (2003). Sooner and later waiting time problems for patterns in Markov dependent trials. J. Appl. Prob. 40, 73–86.Google Scholar
Kolev, N. and Minkova, L. (1999). Quotas on runs of successes and failures in a multi-state Markov chain. Commun. Statist. Theory Meth. 28, 2235–2248.Google Scholar
Kolev, N. and Minkova, L. (1999). Run and frequency quotas in a multi-state Markov chain. Commun. Statist. Theory Meth. 28, 2223–2233.Google Scholar
Martin, D. E. K. (2000). On the distribution of the number of successes in fourth- or lower-order Markovian trials. Comput. Operat. Res. 27, 93–109.CrossRefGoogle Scholar
Martin, D. E. K. (2004). Markovian start-up demonstration tests with rejection of units upon observing d failures. Europ. J. Operat. Res. 155, 474–486.Google Scholar
Martin, D. E. K. (2005). Markovian start-up demonstration tests under various scenarios. Submitted.Google Scholar
Martin, D. E. K. and Aston, J. A. D. (2005). Waiting time distribution of the r-th occurrence of a compound pattern in higher-order Markovian sequences. Tech. Rep. 2005-03, Institute of Statistical Science, Academia Sinica.Google Scholar
Resnick, S. (1992). Adventures in Stochastic Processes. Birkhäuser, Boston, MA.Google Scholar
Smith, M. L. and Griffith, W. S. (2003). The analysis and comparison of start-up demonstration tests. Tech. Rep. 391, Department of Statistics, University of Kentucky.Google Scholar
Viveros, R. and Balakrishnan, N. (1993). Statistical inference from start-up demonstration test data. J. Quality Tech. 22, 119–130.CrossRefGoogle Scholar