We use inequalities to design short universal algorithms that can be used to generate random variates from large classes of univariate continuous or discrete distributions (including all log-concave distributions). The expected time is uniformly bounded over all these distributions. The algorithms can be implemented in a few lines of high level language code. In opposition to other black-box algorithms hardly any setup step is required and thus it is superior in the changing parameter case. (author's abstract) / Series: Preprint Series / Department of Applied Statistics and Data Processing
| Identifer | oai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:epub-wu-01_9e4 |
| Date | January 2000 |
| Creators | Leydold, Josef |
| Publisher | Department of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business |
| Source Sets | Wirtschaftsuniversität Wien |
| Language | English |
| Detected Language | English |
| Type | Working Paper, NonPeerReviewed |
| Format | application/pdf |
| Relation | http://epub.wu.ac.at/1756/ |
Page generated in 0.0021 seconds