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

Share:

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.

Author
Francisco Juretig
Date of publication
2012-09-20 06:42:30
Maintainer
Francisco Jureitg <fjuretig@yahoo.com>
License
GPL-2
Version
1.0

View on CRAN

Man pages

binomialcftp-package
Generates Random Numbers according to the coupling from the...
bin_ps
CFTP Binomial Random Numbers
draw_i
generate random integer numbers

Files in this package

binomialcftp
binomialcftp/MD5
binomialcftp/R
binomialcftp/R/draw_i.R
binomialcftp/R/bin_ps.R
binomialcftp/R/binomialcftp-internal.R
binomialcftp/NAMESPACE
binomialcftp/man
binomialcftp/man/draw_i.Rd
binomialcftp/man/bin_ps.Rd
binomialcftp/man/binomialcftp-package.Rd
binomialcftp/DESCRIPTION