A sweep-plane algorithm by Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept through the given polytope until a random fraction (sampled from a proper univariate distribution) of the volume of the polytope is covered. Then the intersection of the plane with the polytope is a simple polytope with smaller dimension. In the second part we apply this method to construct a black-box algorithm for log-concave and T-concave multivariate distributions by means of transformed density rejection. (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_9d7 |
Date | January 1997 |
Creators | Leydold, Josef, Hörmann, Wolfgang |
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 | Paper, NonPeerReviewed |
Format | application/pdf |
Relation | http://dx.doi.org/10.1090/S0025-5718-98-01004-7, http://www.ams.org/mcom/1998-67-224/S0025-5718-98-01004-7, http://epub.wu.ac.at/476/ |
Page generated in 0.008 seconds