Abstract
Chapters I–XIV are based on the premises that a perfect uniform [0,1] random variate generator is available and that real numbers can be manipulated and stored. Now we drop the first of these premises and Instead assume a perfect bit generator (i.e., a source capable of generating lid {0,1} random varlates B 1,B 2,…), While still assuming that real numbers can be manipulated and stored, as before: this is for example necessary when someone gives us the probabilities p n for discrete random variate generation. The cost of an algorithm can be measured in terms of the number of bits required to generate a random variate. This model is due to Knuth and Yao (1976) who introduced a complexity theory for nonuniform random variate generation. We will report the main ideas of Knuth and Yao in this chapter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer Science+Business Media New York
About this chapter
Cite this chapter
Devroye, L. (1986). The Random Bit Model. In: Non-Uniform Random Variate Generation. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8643-8_15
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8643-8_15
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-8645-2
Online ISBN: 978-1-4613-8643-8
eBook Packages: Springer Book Archive