Automatic Markov Chain Monte Carlo Procedures for Sampling from Multivariate Distributions

Roman Karawatzki, Josef Leydold

Publication: Working/Discussion PaperWU Working Paper

5 Downloads (Pure)


Generating samples from multivariate distributions efficiently is an important task in Monte Carlo integration and many other stochastic simulation problems. Markov chain Monte Carlo has been shown to be very efficient compared to "conventional methods", especially when many dimensions are involved. In this article we propose a Hit-and-Run sampler in combination with the Ratio-of-Uniforms method. We show that it is well suited for an algorithm to generate points from quite arbitrary distributions, which include all log-concave distributions. The algorithm works automatically in the sense that only the mode (or an approximation of it) and an oracle is required, i.e., a subroutine that returns the value of the density function at any point x. We show that the number of evaluations of the density increases slowly with dimension. (author's abstract)
Original languageEnglish
Place of PublicationVienna
PublisherDepartment of Statistics and Mathematics, Abt. f. Angewandte Statistik u. Datenverarbeitung, WU Vienna University of Economics and Business
Publication statusPublished - 2005

Publication series

SeriesPreprint Series / Department of Applied Statistics and Data Processing

WU Working Paper Series

  • Preprint Series / Department of Applied Statistics and Data Processing

Cite this