Generating gamma variates by a modified rejection technique

  title={Generating gamma variates by a modified rejection technique},
  author={J. H. Ahrens and Ulrich Dieter},
  journal={Commun. ACM},
A suitable square root transformation of a gamma random variable with mean a ≥ 1 yields a probability density close to the standard normal density. A modification of the rejection technique then begins by sampling from the normal distribution, being able to accept and transform the initial normal observation quickly at least 85 percent of the time (95 percent if a ≥ 4). When used with efficient subroutines for sampling from the normal and exponential distributions, the resulting accurate method… Expand
Generating Student’s T Variates by a Modified Rejection Method
A new algorithm for sampling from Student’s ta distributions with parameter a > 3 is presented. The method is based on a modified acceptance-rejection technique introduced in 1981 by J.H. Ahrens forExpand
Logarithmic Transformation-Based Gamma Random Number Generators
Developing efficient gamma variate generators is important for Monte Carlo methods. With a brief review of existing methods for generating gamma random numbers, this article proposes two simple gammaExpand
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. Expand
Generating gamma variates
  • D. Minh
  • Mathematics, Computer Science
  • TOMS
  • 1988
An algorithm to generate variates having a gamma distribution with shape parameter greater than one is presented, which is faster than Schmeiser and Lal's G4PE, yet is equally simple and easy to implement. Expand
A simple approximation for the simulation of continuous random variables
A simple technique is described for simulations and analytical studies where the indication is of a unimodal, right-skewed dis tribution of a continuous random variable, the type of distribu tionExpand
Efficient table-free sampling methods for the exponential, Cauchy, and normal distributions
Three algorithms for sampling from exponential, Cauchy and normal distributions are developed. They are based on the "exact approximation" method, and their expected numbers of consumed uniformExpand
Generating random numbers from a distribution specified by its Laplace transform
  • M. Ridout
  • Mathematics, Computer Science
  • Stat. Comput.
  • 2009
This paper advocates simulation by the inversion method using a modified Newton-Raphson method, with values of the distribution and density functions obtained by numerical transform inversion, and shows that this algorithm performs well in a series of increasingly complex examples. Expand
Random variate generation for exponentially and polynomially tilted stable distributions
This work develops exact random variate generators for the polynomially and exponentially tilted unilateral stable distributions and presents a novel double rejection method that is useful whenever densities have an integral representation involving an auxiliary variable. Expand
Simulating theta random variates
We develop an exact simple random variate generator for the theta distribution, which occurs as the limit distribution of the height of nearly all models of uniform random trees. Even though theExpand
Two New Ratio-of-Uniforms Gamma Random Number Generators
Two simple algorithms to generate gamma random numbers are proposed in this article. Both algorithms use the ratio-of-uniforms method and are based on logarithmic transformations of the gamma randomExpand


Acceptance-Rejection Techniques for Sampling from The Gamma and Beta Distributions.
Abstract : John von Neumann's idea of sampling from a distribution by majorizing its probability density function is applied to gamma and beta distributions. Optimum envelopes are constructedExpand
A survey of methods for sampling from the gamma distribution
The current state of the art in gamma random variate generation is surveyed including the leading algorithms of Ahrens and Dieter, Atkinson, Cheng, Fishman, Marsaglia, Tadikamalla and Wallace. Expand
On computer generation of gamma random variables by rejection and composition procedures 2
The paper presents various algorithms for generating gamma random variables, by combining rejection and composition procedures. Two efficient algorithms are given for the case when the parameter ofExpand
Computer generation of gamma random variables
A new method for generating random variables from the gamma distribution with nonintegral shape parameter α is proposed. This method is similar to two other methods recently given by Wallace andExpand
Computer Generation of Random Variables Using the Ratio of Uniform Deviates
The ratio-of-uniforms method for generating random variables having continuous nonuniform distributions is presented and can be used for generating short and often as fast algorithms as well as longer algorithms. Expand
Sampling from the gamma distribution on a computer
This paper describes a method of generating gamma variates that appears to be less costly than Wallace's recently suggested method, and which also dominates methods recently suggested by Dieter and Ahrens. Expand
Some Simple Gamma Variate Generators
SUMMARY Gamma variates with index a> 1 are produced by combining two adaptations of Kinderman and Monahan's technique for generating random variates by the use of the ratio of uniform variates.Expand
An Easily Programmed Algorithm for Generating Gamma Random Variables
THIS note describes an easily programmed algorithm for generating gamma random variables with index ax greater than one which is intended to be complementary to the algorithms GO of Ahrens and DieterExpand
The squeeze method for generating gamma variates
Abstract This paper describes an exact method for computer generation of random variables with a gamma distribution. The method is based on the Wilson-Hilferty transformation and an improvement onExpand
The Generation of Gamma Variables with Non‐Integral Shape Parameter
A rejection method is described for generating exact gamma variates with shape parameter α, where α > 1. The method is compared with previously published methods in terms of speed and programExpand