binomialcftp: Generates binomial random numbers via the coupling from the past algorithm

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

Downloads:

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
OS X El Capitan binaries: r-release: binomialcftp_1.0.tgz
OS X Mavericks binaries: r-oldrel: binomialcftp_1.0.tgz

Linking:

Please use the canonical form https://CRAN.R-project.org/package=binomialcftp to link to this page.