Fast generation of uniformly distributed pseudorandom numbers with floating-point representation

@article{Walker1974FastGO,
  title={Fast generation of uniformly distributed pseudorandom numbers with floating-point representation},
  author={Alastair J. Walker},
  journal={Electronics Letters},
  year={1974},
  volume={10},
  pages={533-534}
}
  • A. J. Walker
  • Published 12 December 1974
  • Computer Science
  • Electronics Letters
A new method is presented for generating uniformly distributed pesudorandom numbers with a floating-point representation. The mantissa and exponent are considered as statistically independent variables, the first possessing a uniform frequency distribution and the second a truncated geometric distribution. A digital hardware implementation of the system features fast single-clock-pulse operation. 
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
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
Adding approximate counters
TLDR
Two machine-learning algorithms for topic modeling that use millions of integer counters are described and it is confirmed that replacing the integer counters with approximate counters is effective, speeding up a GPU-based implementation by over 65% and a CPU-based by nearly 50%, as well as reducing memory requirements, without degrading their statistical effectiveness.
An alternate proof for the representation of discrete distributions by equiprobable mixtures
  • U. Dieter
  • Mathematics
    Journal of Applied Probability
  • 1982
The paper contains a simple proof that every finite discrete distribution is the equiprobable mixture of r distributions, each of which has at most a mass points.
Sampling from a Discrete Distribution While Preserving Monotonicity
Abstract This article describes a cutpoint sampling method for efficiently sampling from an n-point discrete distribution that preserves the monotone relationship between a uniform deviate and the
The alias and alias-rejection-mixture methods for generating random variables from probability distributions
The alias-rejection-mixture method is a general and exact method for the computer generation of random variables from an arbitrary discrete, continuous, or mixed probability distribution. The method
Simulation of Bivariate Observations
TLDR
It is felt that it is very important for a reader of this book to know at least some essential details about the simulation of observations from a specified bivariate probability function.
A BRDF Database Employing the Beard-Maxwell Reflection Model
The Beard-Maxwell reflection model is presented as a new local reflection model for use in realistic image synthesis. The model is important because there is a public domain database of surface
...
...