Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T19:23:38.287Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  14 July 2016

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: jaston@stat.sinica.edu.tw
∗∗ Postal address: Department of Mathematics, Howard University, Washington, DC 20059, USA. Email address: donald.e.martin@census.gov
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.

Information

Type
Research Papers
Copyright
© Applied Probability Trust 2005