The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Implementation of both the exact and approximation methods for computing the cdf of the Poisson binomial distribution as described in Hong (2013) <doi:10.1016/j.csda.2012.10.006>. It also provides the pmf, quantile function, and random number generation for the Poisson binomial distribution. The C code for fast Fourier transformation (FFT) is written by R Core Team (2019)<https://www.R-project.org/>, which implements the FFT algorithm in Singleton (1969) <doi:10.1109/TAU.1969.1162042>.
| Version: | 1.6 |
| Published: | 2024-08-23 |
| DOI: | 10.32614/CRAN.package.poibin |
| Author: | Yili Hong [aut, cre], R Core Team [aut, cph] |
| Maintainer: | Yili Hong <yilihong at vt.edu> |
| License: | GPL-2 |
| NeedsCompilation: | yes |
| In views: | Distributions |
| CRAN checks: | poibin results |
| Reference manual: | poibin.pdf |
| Package source: | poibin_1.6.tar.gz |
| Windows binaries: | r-devel: poibin_1.6.zip, r-release: poibin_1.6.zip, r-oldrel: poibin_1.6.zip |
| macOS binaries: | r-release (arm64): poibin_1.6.tgz, r-oldrel (arm64): poibin_1.6.tgz, r-release (x86_64): poibin_1.6.tgz, r-oldrel (x86_64): poibin_1.6.tgz |
| Old sources: | poibin archive |
| Reverse depends: | sgof |
| Reverse imports: | BiFET, ecospat, EventPointer, FEprovideR, GGMnonreg, SSDM |
| Reverse suggests: | forrel, GENESIS |
Please use the canonical form https://CRAN.R-project.org/package=poibin to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.