Abstract
Some applications demand that random combinatorial objects be generated: by definition, a combinatorial object is an object that can be put into one-to-one correspondence with a finite set of integers. The main difference with discrete random varlate generation is that the one-to-one mapping is usually complicated, so that it may not be very efficient to generate a random integer and then determine the object by using the one-to-one mapping. Another characteristic is the size of the problem: typically, the number of different objects is phenomenally large. A final distinguishing feature is that most users are interested in the uniform distribution over the set of objects.
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). Random Combinatorial Objects. In: Non-Uniform Random Variate Generation. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8643-8_13
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8643-8_13
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