poibin-package | R Documentation |
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>.
This package was not yet installed at build time.
Index: This package was not yet installed at build time.
Yili Hong [aut, cre], R Core Team [aut, cph]
Maintainer: Yili Hong <yilihong@vt.edu>
Hong, Y. (2013). On computing the distribution function for the Poisson binomial distribution. Computational Statistics & Data Analysis, Vol. 59, pp. 41-51.
R Core Team (2019). “R: A Language and Environment for Statistical Computing,” R Foundation for Statistical Computing, Vienna, Austria, url: https://www.R-project.org/.
Singleton, R. C. (1969). An algorithm for computing the mixed radix fast Fourier transform. IEEE Transactions on Audio and Electroacoustics, Vol. 17, pp. 93-103.
kk=0:10
pp=c(.1,.2,.3,.4,.5)
ppoibin(kk=kk, pp=pp, method = "DFT-CF",wts=rep(2,5))
ppoibin(kk=kk, pp=pp, method = "RF",wts=rep(2,5))
ppoibin(kk=kk, pp=pp, method = "RNA",wts=rep(2,5))
ppoibin(kk=kk, pp=pp, method = "NA",wts=rep(2,5))
ppoibin(kk=kk, pp=pp, method = "PA",wts=rep(2,5))
dpoibin(kk=kk, pp=pp,wts=rep(2,5))
qpoibin(qq=0:10/10,pp=pp,wts=rep(2,5))
rpoibin(m=2,pp=pp,wts=rep(2,5))
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.