Lengths of runs and waiting time distributions by using Pólya-Eggenberger sampling scheme
From MaRDI portal
Publication:4432113
DOI10.1556/SSCMATH.39.2002.3-4.5zbMath1026.60019MaRDI QIDQ4432113
Kanwar Sen, Sonali Chakraborty, Manju Lata Agarwal
Publication date: 14 October 2003
Published in: Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)
lattice path approachPólya-Eggenberger sampling schemesuccess and failure runs`balls into cells' techniquelongest and smallest runssooner and later waiting time distributions
Related Items (13)
Generalized waiting time distributions associated with runs ⋮ Stochastic ordering among success runs statistics in a sequence of exchangeable binary trials ⋮ Minimum and maximum distances between failures in binary sequences ⋮ Run statistics in a sequence of arbitrarily dependent binary trials ⋮ Shortest and longest length of success runs in binary sequences ⋮ Distribution of runs in a sequence of exchangeable multi-state trials ⋮ Geometric distribution of order \(k\) with a reward ⋮ Distribution of run statistics in partially exchangeable processes ⋮ On success runs of length exceeded a threshold ⋮ On success runs of a fixed length in Bernoulli sequences: exact and asymptotic results ⋮ Success run statistics defined on an urn model ⋮ \(g\)-geometric and \(g\)-binomial distributions of order image ⋮ Run Statistics Defined on the Multicolor URN Model
This page was built for publication: Lengths of runs and waiting time distributions by using Pólya-Eggenberger sampling scheme