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

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.

AuthorFrancisco Juretig
Date of publication2012-09-20 06:42:30
MaintainerFrancisco Jureitg <fjuretig@yahoo.com>
LicenseGPL-2
Version1.0
Package repositoryView on CRAN
InstallationInstall the latest version of this package by entering the following in R:
install.packages("binomialcftp")

Getting started

Package overview

Popular 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
See all...

All man pages Function index File listing

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

Functions

bin_ps Man page Source code
binomialcftp Man page
binomialcftp-package Man page
draw_i Man page Source code

Files

MD5
R
R/draw_i.R
R/bin_ps.R
R/binomialcftp-internal.R
NAMESPACE
man
man/draw_i.Rd
man/bin_ps.Rd
man/binomialcftp-package.Rd
DESCRIPTION
binomialcftp documentation built on May 19, 2017, 1:52 p.m.

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs in the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.