poibin : The Poisson Binomial Distribution

Testo completo ad accesso aperto Verifica disponibilità: Testo completo (sito dell'editore)

Abstract

Implementation of both the exact and approximation methods for computing the cdf of the Poisson binomial distribution as described in Hong (2013) . 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), which implements the FFT algorithm in Singleton (1969) .

Salvato in:
Autori: Yili Hong iD; R Core Team
Data di pubblicazione:29/10/2012
Tipo di documento:Dataset
Lingua:inglese
DOI: 10.32614/cran.package.poibin
Accesso aperto: Accesso aperto Gold: rivista ad accesso aperto – Testo completo ad accesso aperto
Citazioni ricevute:9
Soggetti:
Probability and Statistical Research (Physical Sciences > Mathematics > Statistics and Probability)
Statistical Distribution Estimation and Applications (Physical Sciences > Mathematics > Statistics and Probability)
Data Analysis with R (Physical Sciences > Computer Science > Artificial Intelligence)
Poisson binomial distribution, cumulative distribution function, probability mass function, quantile function, random number generation, exact computation, approximation methods, fast Fourier transform, R package
Identificativi: OpenAlex W4399532745

Dati dell'indice centrale: OpenAlex (licenza CC0).

Riassunto:Implementation of both the exact and approximation methods for computing the cdf of the Poisson binomial distribution as described in Hong (2013) . 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), which implements the FFT algorithm in Singleton (1969) .
DOI:10.32614/cran.package.poibin