Home
Scholarly Works
Sooner and later waiting time problems for success...
Journal article

Sooner and later waiting time problems for success and failure runs in higher order Markov dependent trials

Abstract

The probability generating functions of the waiting times for the first success run of length k and for the sooner run and the later run between a success run of length k and a failure run of length r in the second order Markov dependent trials are derived using the probability generating function method and the combinatorial method. Further, the systems of equations of 2.mconditional probability generating functions of the waiting times in the m-th order Markov dependent trials are given. Since the systems of equations are linear with respect to the conditional probability generating functions, they can be solved exactly, and hence the probability generating functions of the waiting time distributions are obtained. If m is large, some computer algebra systems are available to solve the linear systems of equations.

Authors

Aki S; Balakrishnan N; Mohanty SG

Journal

Annals of the Institute of Statistical Mathematics, Vol. 48, No. 4, pp. 773–787

Publisher

Springer Nature

Publication Date

January 1, 1996

DOI

10.1007/bf00052332

ISSN

0020-3157
View published work (Non-McMaster Users)

Contact the Experts team