Non-Uniform Random Variate Generation

@inproceedings{Devroye1986NonUniformRV,
  title={Non-Uniform Random Variate Generation},
  author={Luc Devroye},
  year={1986}
}
  • L. Devroye
  • Published 16 April 1986
  • Computer Science, Mathematics
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 transformations are reviewed. We provide information on the expected time complexity of various algorithms, before addressing modern topics such as indirectly specified distributions, random processes, and Markov chain methods. Authors’ address: School of Computer Science, McGill University, 3480… 

Tables from this paper

Random Number and Variate Generation

This chapter discusses various methods for the generation of random samples distributed according to given probability distributions, in both the univariate and multivariate cases. These methods can

Uniform random number generation

  • P. L'Ecuyer
  • Mathematics, Computer Science
    Ann. Oper. Res.
  • 1994
Practical ways of generating uniform variates for several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear Congruential over fields of formal series, and combined generators are examined.

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.

Random-number and random-variate generation: automatic random variate generation for simulation input

Algorithms for generating random variates for simulation input based on the rejection principle, a mixture of naive resampling and sampling from the multi-normal distribution that has the same co-variance matrix as the data, and algorithms that generate random variate directly from a given sample by implicitly estimating the unknown distribution are presented.

Random variate generation by numerical inversion when only the density is known

The proposed algorithm is based on polynomial interpolation of the inverse CDF and Gauss-Lobatto integration and is the fastest inversion method known for generating random variates from continuous distributions when only the density function is given.

Density Estimation and Random Variate Generation

It is proved that the convergence to the true density for both the density estimation and random variate generation techniques at a rate where is the number of data points and can be made arbitrarily small for sufficiently smooth target densities, which is very close to the optimally achievable convergence rate under similar smoothness conditions.

Automatic random variate generation for simulation input

  • W. HormannJ. Leydold
  • Computer Science
    2000 Winter Simulation Conference Proceedings (Cat. No.00CH37165)
  • 2000
Algorithms for generating random variates for simulation input based on the rejection principle, a mixture of naive resampling and sampling from the multi-normal distribution that has the same covariance matrix as the data are developed and evaluated.

Chapter 4 Nonuniform Random Variate Generation

THE TRANSFORMED REJECTION METHODFOR GENERATING RANDOM VARIABLES , AN ALTERNATIVE TO THE RATIO OF UNIFORMS

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
...

References

SHOWING 1-10 OF 71 REFERENCES

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.

Monte Carlo Sampling Methods Using Markov Chains and Their Applications

SUMMARY A generalization of the sampling method introduced by Metropolis et al. (1953) is presented along with an exposition of the relevant theory, techniques of application and methods and

An automatic method for generating random variates with a given characteristic function

An automatic method is developed for the computer generation of random variables with a characteristic function satisfying certain regularity conditions. The method is based upon a generalization of

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

Methods for generating random variates with Polya characteristic functions

Squeeze Methods for Generating Gamma Variates

Two algorithms are given for generating gamma distributed random variables, valid when the shape parameter is greater than one, which use a uniform majorizing function for the body of the distribution and exponential majorizing functions for the tails.

A Fast, Easily Implemented Method for Sampling from Decreasing or Symmetric Unimodal Density Functions

A new method is described, suitable for any decreasing or symmetric unimodal density, that is faster and more easily implemented, thereby providing a standard procedure for developing both the fast and the slow part for many given densities.

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

On the computer generation of random variables with a given characteristic function

The Series Method for Random Variate Generation and Its Application to the Kolmogorov-Smirnov Distribution

SYNOPTIC ABSTRACTThis paper presents a series method for the computer generation of a random variable X with density f when f = fn = gn and fn and gn are given sequences of functions satisfying fn ≥
...