Return to search

Automatic Random Variate Generation for Unbounded Densities

A new automatic algorithm for sampling from monotone, unbounded densities is presented. The user has to provide a program to evaluate the density and its derivative and the location of the pole. Then the setup of the new algorithm constructs different hat functions for the pole region and for the tail region, respectively. For the pole region a new method is developed that uses a transformed density rejection hat function of the inverse density. As the order of the pole is calculated in the setup, conditions that guarantee the correctness of the constructed hat functions are provided. Numerical experiments indicate that the new algorithm works correctly and moderately fast for many different unbounded densities. The proposed algorithm is the first black-box method that works for unbounded densities suggested in the literature. (author's abstract) / Series: Research Report Series / Department of Statistics and Mathematics

Identiferoai:union.ndltd.org:VIENNA/oai:epub.wu-wien.ac.at:epub-wu-01_b1a
Date January 2006
CreatorsHörmann, Wolfgang, Leydold, Josef, Derflinger, Gerhard
PublisherDepartment of Statistics and Mathematics, WU Vienna University of Economics and Business
Source SetsWirtschaftsuniversität Wien
LanguageEnglish
Detected LanguageEnglish
TypePaper, NonPeerReviewed
Formatapplication/pdf
Relationhttp://epub.wu-wien.ac.at/dyn/openURL?id=oai:epub.wu-wien.ac.at:epub-wu-01_c4f, http://epub.wu.ac.at/848/

Page generated in 0.0055 seconds