Binomial random numbers are generated via the perfect sampling algorithm. At each iteration dual markov chains are generated and coalescence is checked. In case coalescence occurs, the resulting number is outputted. In case not, then the algorithm is restarted from T(t)=2*T(t) until coalescence occurs.
|Date of publication||2012-09-20 06:42:30|
|Maintainer||Francisco Jureitg <firstname.lastname@example.org>|