Universal Methods

Luc Devroye
Additional contact information
Luc Devroye: McGill University, School of Computer Science

Chapter Chapter Seven in Non-Uniform Random Variate Generation, 1986, pp 286-357 from Springer

Abstract: 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.

Keywords: Hazard Rate; Normal Scale; Repeat Generate; Universal Method; Uniform Random Variate (search for similar items in EconPapers)
Date: 1986
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-8643-8_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461386438

DOI: 10.1007/978-1-4613-8643-8_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().