Automatic sampling with the ratio-of-uniforms method

Authors
Citation
J. Leydold, Automatic sampling with the ratio-of-uniforms method, ACM T MATH, 26(1), 2000, pp. 78-98
Citations number
38
Categorie Soggetti
Computer Science & Engineering
Journal title
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
ISSN journal
00983500 → ACNP
Volume
26
Issue
1
Year of publication
2000
Pages
78 - 98
Database
ISI
SICI code
0098-3500(200003)26:1<78:ASWTRM>2.0.ZU;2-D
Abstract
Applying the ratio-of-uniforms method for generating random variates result s in very efficient, fast, and easy-to-implement algorithms. However parame ters for every particular type of density must be precalculated analyticall y. In this article we show, that the ratio-of-uniforms method is also usefu l for the design of a black-box algorithm suitable for a large class of dis tributions, including all with log-concave densities. Using polygonal envel opes and squeezes results in an algorithm that is extremely fast. In opposi tion to any other ratio-of-uniforms algorithm the expected number of unifor m random numbers is less than two. Furthermore, we show that this method is in some sense equivalent to transformed density rejection.