Computer Generation of Random Variables Using the Ratio of Uniform Deviates

@article{Kinderman1977ComputerGO,
  title={Computer Generation of Random Variables Using the Ratio of Uniform Deviates},
  author={Albert J. Kinderman and John F. Monahan},
  journal={ACM Trans. Math. Softw.},
  year={1977},
  volume={3},
  pages={257-260}
}
The ratio-of-uniforms method for generating random variables having continuous nonuniform distributions is presented. In thin method a point is generated uniformly over a particular region of the plane. The ratio of the coordinate values of thin point yields a deviate with the desired distribution. Algorithms which utilize this techmque are generally short and often as fast as longer algorithms. 

Tables from this paper

Efficient generation of random variates via the ratio-of-uniforms method
Improvements to the conventional ratio-of-uniforms method for random variate generation are proposed. A generalized radio-of-uniforms method is introduced, and it is demonstrated that relocation of
A note on the quality of random variates generated by the ratio of uniforms method
TLDR
Lower bounds for probabilities only depending on the modulus and the Beyer quotient of the LCG are proved for the case that Cauchy normal or exponential random numbers are generated, justifying the recommendation not to use the ratio of uniform method combined with LCGs.
The generalized ratio-of-uniform method
TLDR
A random number generation method, which is one of the rejection methods, is presented, and to accelerate ratio-of-uniform method, an efficiency variabler is used.
Computer generation of random variates from the tail of t and normal distributions
An algorithm is developed for the efficient generation of random variates from the tail of a t-distribution. This is specialised to the case of a Normal distribution. Theoretical measures of
Automatic sampling with the ratio-of-uniforms method
TLDR
It is shown, that the ratio-of-uniforms method is also useful for the design of a black-box algorithm suitable for a large class of distributions, including all with log-concave densities.
A fast normal random number generator
TLDR
A method is presented for generating pseudorandom numbers with a normal distribution using the ratio of uniform deviates method discovered by Kinderman and Monahan with an improved set of bounding curves and can be implemented in 15 lines of FORTRAN.
The transformed rejection method for generating random variables, an alternative to the ratio of uniforms method
Theoretical considerations and empirical results show that the one-dimensional quality of non-uniform random numbers is bad and the discrepancy is high when they are generated by the ratio of
An algorithm for generating chi random variables
An algorithm is presented for generating random variables from the chi family of distributions withdegrees of freedom parameter LY 2 1. It is based on the ratio of uniforms method and can be
Efficient generation of random vectors by using the ratio-of-uniforms method with ellipsoidal envelopes
TLDR
A new algorithm to generate random vectors from multivariate distributions from densities known up to a multiplicative constant, for example, from those arising in Bayesian computation is proposed and its efficiency is shown for some classes of distributions.
Generation of Variates from Distribution Tails.
Abstract : The general acceptance/rejection algorithm for generating random values on a computer is specialized for distribution tails, using an exponential majorizing function and a linear
...
...

References

SHOWING 1-10 OF 15 REFERENCES
Algorithm 488: A Gaussian pseudo-random number generator
  • R. Brent
  • Mathematics, Computer Science
    CACM
  • 1974
TLDR
The algorithm calculates the exact cumulative distribution of the two-sided Kolmogorov-Smirnov statistic for samples with few observations for data sampling and discrete system simulation.
A Convenient Method for Generating Normal Variables
A normal random variable X may be generated in terms of uniform random variables $u_1 $, $u_2 $, in the following simple way: 86 percent of the time, put $X = 2(u_1 + u_2 + u_3 - 1.5)$,11 percent of
A Pseudo-Random Number Generator for the System/360
TLDR
A particular pseudo-random number generator is described that uses the full 31-bit capacity of the registers in the IBM SYSTEM/360 computers and has been found to be highly satisfactory.
Computer methods for sampling from the exponential and normal distributions
TLDR
The authors' primary conwiba~ion is the rise of polynomiaI sampling (as ex~ p/tiffed in Section 2) to eliminate any dependency on standard&ruction programs.
Computer methods for samphng from gamma, beta
  • Poisson and binomial distributions. Computing
  • 1974
Computer generation of random variables with normal and student's l distribution
  • Proc. Statist. Comptng. Sect., Amer. Statist. Assoc
  • 1975
U Computer methods for sampling from the exponential and normal distributions Comm
  • ACM
  • 1972
Computer generation of random variables with normal and student's l distribution
  • Proc. Statist. Comptng. Sect., Amer. Statist. Assoc.,
  • 1975
ACM Transactmns on Mathematical Software
  • ACM Transactmns on Mathematical Software
  • 1977
...
...