Nothing
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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Francisco Juretig |
| Maintainer | Francisco Jureitg <fjuretig@yahoo.com> |
| License | GPL-2 |
| Version | 1.0 |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the binomialcftp package in your browser
Any scripts or data that you put into this service are public.
