# Binomial random variate generation

@article{Kachitvichyanukul1988BinomialRV, title={Binomial random variate generation}, author={Voratas Kachitvichyanukul and Bruce W. Schmeiser}, journal={Commun. ACM}, year={1988}, volume={31}, pages={216-222} }

Existing binomial random-variate generators are surveyed, and a new generator designed for moderate and large means is developed. The new algorithm, BTPE, has fixed memory requirements and is faster than other such algorithms, both when single, or when many variates are needed.

#### Tables and Topics from this paper

#### 112 Citations

History of random variate generation

- Computer Science
- 2017 Winter Simulation Conference (WSC)
- 2017

A history of random variate generation including distribution sampling methods used prior to the introduction of digital computers, as well as the evolution of random Variate generators for continuous and discrete distributions and stochastic point processes are presented. Expand

Chapter 4 Nonuniform Random Variate Generation

- Computer Science
- Simulation
- 2006

This chapter provides a survey of the main methods in nonuniform random variate generation, and highlights recent research on the subject, before addressing modern topics such as indirectly specified distributions, random processes, and Markov chain methods. Expand

Fast Generation of Discrete Random Variables

- Mathematics
- 2004

We describe two methods and provide C programs for generating discrete random variables with functions that are simple and fast, averaging ten times as fast as published methods and more than five… Expand

Sampling from Discrete and Continuous Distributions with C-Rand

- Mathematics
- 1992

C-RAND is a system of Turbo-C routines and functions intended for use on microcomputers. It contains up-to-date random number generators for more than thirty univariate distributions. For some… Expand

The ratio of uniforms approach for generating discrete random variates

- Mathematics
- 1990

Abstract The most efficient algorithms for sampling from classical discrete distributions are based upon the acceptance/rejection principle. They are complicated and not easy to understand. By… Expand

The generation of binomial random variates

- Mathematics
- 1993

The transformed rejection method, a combination of inversion and rejection, which can be applied to various continuous distributions, is well suited to generate binomial random variates as well. The… Expand

Simulating Size-constrained Galton-Watson Trees

- Mathematics, Computer Science
- SIAM J. Comput.
- 2012

We discuss various methods for generating random Galton-Watson trees conditional on their sizes being equal to $n$. A linear expected time algorithm is proposed.

Generation of random objects

- Computer Science, Mathematics
- WSC '92
- 1992

We illustrate the paradigm that various random objects defined in terms of random processes can be generated quite efficiently without actually ‘running” or ‘simulating” the defining random process.… Expand

Algorithm 678: BTPEC: sampling from the binomial distribution

- Computer Science
- TOMS
- 1989

The FORTRAN implementation of an exact, uniformly fast algorithm for generating the binomial, random variables is presented. The algorithm is numerically stable and is faster than other published… Expand

Non-Uniform Random Variate Generation

- Mathematics
- 1986

This is a survey of the main methods in non-uniform random variate generation, and highlights recent research on the subject. Classical paradigms such as inversion, rejection, guide tables, and… Expand

#### References

SHOWING 1-10 OF 32 REFERENCES

Binomial random variate generation

- Computer Science
- 1988

A new binomial random-variate generator designed for moderate and large means is developed, which has fixed memory requirements and is fast and scalable. Expand

On Generating Random Variates from an Empirical Distribution

- Mathematics
- 1974

Abstract This note presents a method for generating a sequence of random variates from an empirical distribution. Computational results show that the proposed method requires less computation time… Expand

An Efficient Method for Generating Discrete Random Variables with General Distributions

- Mathematics, Computer Science
- TOMS
- 1977

The fast generation of discrete random variables with arbitrary frequency distributions is discussed. The proposed method is related to rejection techniques but differs from them in that all samples… Expand

Random Variate Generation: A Survey.

- Computer Science
- 1980

Abstract : The state of the art of generating random variates on a digital computer is surveyed. General concepts are presented, followed by criteria for comparing algorithms. The literature is… Expand

Beta Variate Generation via Exponential Majorizing Functions

- Mathematics, Computer Science
- Oper. Res.
- 1980

Two acceptance/rejection algorithms for generating random variates from the beta distribution are developed and are relatively insensitive to parameter values and are faster than any previously published algorithms. Expand

Recent Developments in the Computer Generation of Poisson Random Variables

- Mathematics
- 1979

Two recent methods of generating samples on a computer from the Poisson distribution are compared with those in an earlier survey. Recommendations are made for algorithms which are either compact or… Expand

Poisson Random Variate Generation.

- Mathematics
- 1981

Abstract : Approximate algorithms have long been the only available methods for generating Poisson random variates when the mean is large. A new algorithm is developed that is exact, has execution… Expand

A Simple Algorithm for Generating Binomial Random Variables When N is Large

- Mathematics
- 1972

Abstract This article proposes a simple algorithm for generating binomial (N, p) random variables when N is large. The method involves looking mainly at medians in uniform (0, 1) samples of size… Expand

Random variate generation

- Computer Science
- WSC '81
- 1981

This paper updates the more than 300 references cited in last year's paper and concludes with a state of the art survey of methods for generating random variates on a digital computer. Expand

Computer Generation of Poisson Deviates from Modified Normal Distributions

- Mathematics, Computer Science
- TOMS
- 1982

Using efficient subprograms for generating uniform, exponential, alid normal deviates, the new algorithm is much faster than all competing methods. Expand