A Rejection Technique for Sampling from Log-Concave Multivariate Distributions

ACM Transactions on Modeling and Computer Simulation

Volumn 8, Issue 3, 1998, Pages 254-280

  Leydold, Josef ^a  

^a VIENNA UNIVERSITY OF ECONOMICS AND BUSINESS   (Austria)

Author keywords

Multivariate log concave distributions; Rejection method

Indexed keywords

ALGORITHMS; MATRIX ALGEBRA; SAMPLING; STUDENTS; VECTORS;

MULTIVARIATE DISTRIBUTIONS; REJECTION METHOD;

MULTIVARIABLE SYSTEMS;

EID: 0012717593     PISSN: 10493301     EISSN: None     Source Type: Journal    
DOI: 10.1145/290274.290287     Document Type: Article

References (32)

1. AHRENS, J. AND DIETER, U. 1982. Generating gamma variates by a modified rejection technique. Commun. ACM 25, 1 (Jan.), 47-54.
2. AHRENS, J. H. 1995. A one-table method for sampling from continuous and discrete distributions. Computing 54, 127-146.
3. BELL, M. AND PIKE, M. C. 1966. Remark on algorithm 178. Commun. ACM 9, 9 (Sept.), 684-686.
4. Box, G. AND MULLER, M. 1958. A note on the generation of random normal deviates. Ann. Math. Stat. 29, 2, 610-611.
5. DAGPUNAR, J. 1988. Principles of Random Variate Generation. Clarendon Press, Oxford.
6. DERFLINGER, G. AND HORMANN, W. 1994. The optimal selection of hat functions for rejection algorithms. Manuscript, private communication.
7. DEVROYE, L. 1986. Non-Uniform Random Variate Generation. Sprnger-Verlag, New York.
8. DEVROYE, L. 1997. Random variate generation for multivariate densities. ACM Trans. Model. Comput. Simul. 7, 4 (Oct.), 447-477.
9. EVANS, M. AND SWARTZ, T. 1997. Random variable generation using concavity properties of transformed densities. J. Comput. Graph. Stat. (to appear).
10. FORSYTHE, G. E., MALCOLM, M. A., AND MOLER, C. B. 1977. Computer Methods for Mathematical Computations, Seventh edition. Prentice-Hall Series in Automatic Computation, Prentice-Hall, Englewood Cliffs, NJ.
11. GILKS, W. R. AND WILD, P. 1992. Adaptive rejection sampling for Gibbs sampling. Appl. Stat. 41, 337-348.
12. GRADSHTEYN, I. S. AND RYZHNIK, I. M. 1965. Table of Integrals, Fifth edition. Academic, San Diego, CA.
13. GRÜNBAUM, B. 1967. Convex Polytopes. Interscience, New York.
14. HOOKE, R. AND JEEVES, T. A. 1961. "Direct search" solution of numerical and statistical problems. J. ACM 8, 2, 212-229.
15. HÖRMANN, W. 1994. The quality of non-uniform random numbers. In Operations Research Proceedings 1993 (Berlin), H. Dyckhoff et al. Eds., 329-335.
16. HÖRMANN, W. 1995a. A rejection technique for sampling from T-concave distributions. ACM Trans. Math. Softw. 21, 1, 182-193.
17. HÖRMANN, W. 1995b. A universal generator for bivariate log-concave distributions. Preprint.
18. HÖRMANN, W. AND DERFLINGER, G. 1994. Universal generators for correlation induction. In Compstat, Proceedings in Computational Statistics (Heidelberg), R. Dutter and W. Grossmann, Eds., 52-57.
19. JOHNSON, M. E. 1987. Multivariate Statistical Simulation. Wiley, New York.
20. JOHNSON, N. L., KOTZ, S., AND BALAKRISHNAN, N. 1995. Continuous Univariate Distributions, Second edition, Volume 2. Wiley-Interscience, New York.
21. KAUPE, A. F., JR. 1963. Algorithm 178: Direct search. Commun. ACM 6, 6 (June), 313-314.
22. LAWRENCE, J. 1991. Polytope volume computation. Math. Comput. 57, 195, 259-271.
23. LEEB, H. AND WEGENKITTL, S. 1997. Inversive and linear congruential pseudorandom number generators in empirical tests. ACM Trans. Math. Comput. Simul. 7, 2, 272-286.
24. LEYDOLD, J. 1998. TDRMV - Generating Multivariate Log-Concave Densities with Transformed Density Rejection. Institut für Statistik, Wirtschaftsuniversität Wien. Code available at ftp://statistik.wu-wien.ac.at/src/tdrmv/.
25. LEYDOLD, J. AND HORMANN, W. 1998. A sweep plane algorithm for generating random tuples in simple polytopes. Math. Comput. 67, 1617-1635.
26. PRÉKOPA, A. 1973. On logarithmic concave measures and functions. Acta Sci. Math. Hungarica 34, 335-343.
27. RAO, S. S. 1984. Optimization. Theory and Applications, Second edition. Wiley Eastern, New Delhi.
28. STEFǍNESCU, S. AND VǍDUVA, I. 1987. On computer generation of random vectors by transformations of uniformly distributed vectors. Computing 39, 141-153.
29. TODD, M. J. 1976. The Computation of Fixed Points and Applications. LNEMS 124, Springer, Berlin.
30. TODD, M. J. 1978. Improving the convergence of fixed-point algorithms. Math. Program. Stud. 7, 151-169.
31. WAKEFIELD, J. C., GELFAND, A. E., AND SMITH, A. F. M. 1991. Efficient generation of random variates via the ratio-of-uniforms method. Stat. Comput. 1, 129-133.
32. ZIEGLER, G. M. 1995. Lectures on Polytopes. Graduate Texts in, Mathematics 152, Springer-Verlag, New York.