Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T10:56:33.389Z Has data issue: false hasContentIssue false

Waiting times for patterns in a sequence of multistate trials

Published online by Cambridge University Press:  14 July 2016

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

Abstract

Let X n , n ≥ 1 be a sequence of trials taking values in a given set A, let ∊ be a pattern (simple or compound), and let X r,∊ 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 X r,∊ in the case of the non-overlapping and overlapping way of counting runs and patterns. Several extensions and generalizations are also discussed.

Information

Type
Research Papers
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.)

Article purchase

Temporarily unavailable