Binomial random variate generation

  title={Binomial random variate generation},
  author={Voratas Kachitvichyanukul and Bruce W. Schmeiser},
  journal={Commun. ACM},
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 from this paper

History of random variate generation

  • M. Kuhl
  • Mathematics
    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.

Chapter 4 Nonuniform Random Variate Generation

Fast Generation of Discrete Random Variables

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

Sampling from Discrete and Continuous Distributions with C-Rand

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

The generation of binomial random variates

The transformed rejection method, a combination of inversion and rejection, is well suited to generate binomial random variates as well and for the case that the parameters of the binomial distribution vary from call to call BTRD is faster than the current state of the art algorithms.

Simulating Size-constrained Galton-Watson Trees

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

  • L. Devroye
  • Mathematics, Computer Science
    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.

Algorithm 678: BTPEC: sampling from the binomial distribution

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

Non-Uniform Random Variate Generation

This chapter reviews the main methods for generating random variables, vectors and processes in non-uniform random variate generation, and provides information on the expected time complexity of various algorithms before addressing modern topics such as indirectly specified distributions, random processes, and Markov chain methods.



On Generating Random Variates from an Empirical Distribution

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

An Efficient Method for Generating Discrete Random Variables with General Distributions

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

Random Variate Generation: A Survey.

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

Recent Developments in the Computer Generation of Poisson Random Variables

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

Poisson Random Variate Generation.

A new algorithm is developed that is exact, has execution time insensitive to the value of the mean, and is valid whenever the mean is greater than ten, and this algorithm is compared to the three other algorithms which have been developed recently for generating Poisson variates when themean is large.

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

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

Random variate generation

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.

Computer Generation of Poisson Deviates from Modified Normal Distributions

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

Generating beta variates with nonintegral shape parameters

A new rejection method is described for generating beta variates and is suggested that the method has advantages in both speed and programming simplicity over previous methods, especially for “difficult” combinations of parameter values.