Lengths of runs and waiting time distributions by using Pólya-Eggenberger sampling scheme

2002 ◽  
Vol 39 (3-4) ◽  
pp. 309-332 ◽  
Author(s):  
K. Sen ◽  
Manju L. Agarwal ◽  
S. Chakraborty

In this paper, joint distributions of number of success runs of length k and number of failure runs of length k' are obtained by using combinatorial techniques including lattice path approach under Pólya-Eggenberger model. Some of its particular cases, for different values of the parameters, are derived. Sooner and later waiting time problems and joint distributions of number of success runs of various types until first occurrence of consecutive success runs of specified length under the model are obtained. The sooner and later waiting time problems for Bernoulli trials (see Ebneshahrashoob and Sobel [3]) and joint distributions of the type discussed by Uchiada and Aki [11] are shown as particular cases. Assuming Ln and Sn to be the lengths of longest and smallest success runs, respectively, in a sample of size n drawn by Pólya-Eggenberger sampling scheme, the joint distributions of Ln and  Sn as well as distribution of M=max(Ln,Fn)n, where Fn is the length of longest failure run, are also  obtained.

1974 ◽  
Vol 11 (1) ◽  
pp. 190-192 ◽  
Author(s):  
M. B. Rajarshi

Success runs of a fixed length in a two-state Markov chain are discussed. The results are analogous to those in the case of independent Bernoulli trials. The generating function of the waiting time for the first occurrence of a success run is obtained from the theory of recurrent events. Under certain conditions, the distribution of the number of long runs in a large number of trials is shown to be Poisson.


1974 ◽  
Vol 11 (01) ◽  
pp. 190-192 ◽  
Author(s):  
M. B. Rajarshi

Success runs of a fixed length in a two-state Markov chain are discussed. The results are analogous to those in the case of independent Bernoulli trials. The generating function of the waiting time for the first occurrence of a success run is obtained from the theory of recurrent events. Under certain conditions, the distribution of the number of long runs in a large number of trials is shown to be Poisson.


10.37236/5753 ◽  
2017 ◽  
Vol 24 (3) ◽  
Author(s):  
Uta Freiberg ◽  
Clemens Heuberger ◽  
Helmut Prodinger

Consider infinite random words over a finite alphabet where the letters occur as an i.i.d. sequence according to some arbitrary distribution on the alphabet. The expectation and the variance of the waiting time for the first completed $h$-run of any letter (i.e., first occurrence of $h$ subsequential equal letters) is computed. The expected waiting time for the completion of $h$-runs of $j$ arbitrary distinct letters is also given.


Author(s):  
Katherine Skalak ◽  
◽  
James Pizzuto ◽  
Diana Karwan ◽  
Adam Benthem ◽  
...  

2019 ◽  
Vol 1 (3) ◽  
Author(s):  
Máté Jenei ◽  
Elina Potanina ◽  
Ruichen Zhao ◽  
Kuan Y. Tan ◽  
Alessandro Rossi ◽  
...  

2005 ◽  
Vol 94 (10) ◽  
Author(s):  
Mattias Lindman ◽  
Kristin Jonsdottir ◽  
Roland Roberts ◽  
Björn Lund ◽  
Reynir Bödvarsson

2000 ◽  
Vol 113 (24) ◽  
pp. 10867-10877 ◽  
Author(s):  
Anatoly B. Kolomeisky ◽  
Michael E. Fisher

Sign in / Sign up

Export Citation Format

Share Document