Affiliation:
1. St. Petersburg State University, 7/9 Universitetskaya nab., St. Petersburg, 199034, Russia
Abstract
AbstractThis paper is devoted to random-bit simulation of probability densities, supported on {[0,1]}. The term “random-bit” means that the source of randomness for simulation is a sequence of symmetrical Bernoulli trials. In contrast to the pioneer paper [D. E. Knuth and A. C. Yao,
The complexity of nonuniform random number generation,
Algorithms and Complexity,
Academic Press, New York 1976, 357–428], the proposed method demands the knowledge of the probability density under simulation, and not the values of the corresponding distribution function. The method is based on the so-called binary decomposition of the density and
comes down to simulation of a special discrete distribution to get several principal bits of output, while further bits of output are produced by “flipping a coin”.
The complexity of the method is studied and several examples are presented.
Subject
Applied Mathematics,Statistics and Probability
Reference30 articles.
1. The expected bit complexity of the von Neumann rejection algorithm;Stat. Comput.,2017
2. High precision discrete gaussian sampling on FPGAs;Selected Areas in Cryptography,2013
3. On distributions computable by random walks on graphs;SIAM J. Discrete Math.,2004
4. Optimal discrete uniform generation from coin flips, and applications;Preprint,2013
5. Randomness complexity of private computation;Comput. Complexity,1999