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.
| Version: | 1.0 |
| Published: | 2012-09-20 |
| Author: | Francisco Juretig |
| Maintainer: | Francisco Jureitg <fjuretig at yahoo.com> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| CRAN checks: | binomialcftp results |
| Reference manual: | binomialcftp.pdf |
| Package source: | binomialcftp_1.0.tar.gz |
| Windows binaries: | r-devel: binomialcftp_1.0.zip, r-release: binomialcftp_1.0.zip, r-oldrel: binomialcftp_1.0.zip |
| macOS binaries: | r-release: binomialcftp_1.0.tgz, r-oldrel: binomialcftp_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=binomialcftp to link to this page.