Abstract
In the next two chapters we will apply the tools of the previous chapters in the design of algorithms that are applicable to large families of distributions. Described in terms of a common property, such as the family of all unimodal densities with mode at 0, these families are generally speaking nonparametric in nature. A method that is applicable to such a large family is called a universal method. For example, the rejection method can be used for all bounded densities on [0,1], and is thus a universal method. But to actually apply the rejection method correctly and efficiently would require knowledge of the supremum of the density. This value cannot be estimated in a finite amount of time unless we have more information about the density in question, usually in the form of an explicit analytic definition. Universal methods which do not require anything beyond what is given in the definition of the family are called black box methods.
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). Universal Methods. In: Non-Uniform Random Variate Generation. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-8643-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4613-8643-8_7
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