Sooner and later waiting time problems for runs in Markov dependent bivariate trials (Q1300755): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q428598 |
||
Property / reviewed by | |||
Property / reviewed by: Rudolf Grübel / rank | |||
Revision as of 00:52, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Sooner and later waiting time problems for runs in Markov dependent bivariate trials |
scientific article |
Statements
Sooner and later waiting time problems for runs in Markov dependent bivariate trials (English)
0 references
4 January 2001
0 references
In a Markov chain \(((X_n,Y_n))_{n \in\mathbb{N}_0}\) with state space \(\{0,1\}^2\) consider the first time that there is either a run of \(k\) successive 1's in \(X_0,X_1, \dots\) or of \(f\) successive 1's in \(Y_0,Y_1, \dots\). A linear system of equations is given for a family of associated probability generating functions. The authors give some numerical examples and mention applications in reliability testing.
0 references
time problems
0 references
Markov chain
0 references