Sampling from binomial and Poisson distributions: a method with bounded computation times
From MaRDI portal
Publication:1135054
DOI10.1007/BF02241999zbMath0424.60018OpenAlexW1495026701MaRDI QIDQ1135054
Ulrich Dieter, Joachim H. Ahrens
Publication date: 1980
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02241999
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
The computer generation of multinomial random variates ⋮ A note on Stirling's expansion for factorial n ⋮ A modal method for generating binomial variables ⋮ The generation of binomial random variates ⋮ On the computer generation of random convex hulls ⋮ The ratio of uniforms approach for generating discrete random variates ⋮ A simple generator for discrete log-concave distributions ⋮ Expected time analysis of a simple recursive Poisson random variate generator ⋮ Exact sublinear binomial sampling ⋮ Simulating from a multinomial distribution with large number of categories ⋮ Generation of Bernoulli processes ⋮ Random variate generators for the Poisson-Poisson and related distributions ⋮ A universal generator for discrete log-concave distributions ⋮ Modeling and Generating Stochastic Inputs for Simulation Studies ⋮ A triptych of discrete distributions related to the stable law
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling from the Poisson distribution on a computer
- Computer methods for sampling from gamma, beta, Poisson and binomial distributions
- An Efficient Method for Generating Discrete Random Variables with General Distributions
- On computer generation of gamma random variables by rejection and composition procedures2
- Computer methods for sampling from the exponential and normal distributions
This page was built for publication: Sampling from binomial and Poisson distributions: a method with bounded computation times
