Exact Sampling from a Continuous State Space

Propp & Wilson (1996) described a protocol, called coupling from the past, for exact sampling from a target distribution using a coupled Markov chain Monte Carlo algorithm. In this paper we extend coupling from the past to various MCMC samplers on a continuous state space; rather than following the monotone sampling device of Propp & Wilson, our approach uses methods related to gamma‐coupling and rejection sampling to simulate the chain, and direct accounting of sample paths.

[1]  E. Nummelin General irreducible Markov chains and non-negative operators: Embedded renewal processes , 1984 .

[2]  D. Gaver,et al.  Robust empirical bayes analyses of event rates , 1987 .

[3]  Adrian F. M. Smith,et al.  Sampling-Based Approaches to Calculating Marginal Densities , 1990 .

[4]  T. Lindvall Lectures on the Coupling Method , 1992 .

[5]  Richard L. Tweedie,et al.  Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.

[6]  J. Rosenthal Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo , 1995 .

[7]  P. Reutter General Strategies for Assessing Convergence of Mcmc Algorithms Using Coupled Sample Paths , 1995 .

[8]  Walter R. Gilks,et al.  Full conditional distributions , 1995 .

[9]  David Bruce Wilson,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996, Random Struct. Algorithms.

[10]  J. Propp,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996 .

[11]  Olle Häggström,et al.  Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some , 1996 .

[12]  D. Jeulin On some weighted Boolean models , 1997 .

[13]  W. Kendall On some weighted Boolean models , 1997 .

[14]  R. Tweedie,et al.  Perfect simulation and backward coupling , 1998 .

[15]  David Bruce Wilson,et al.  How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph , 1998, J. Algorithms.

[16]  Wilfrid S. Kendall,et al.  Perfect Simulation for the Area-Interaction Point Process , 1998 .

[17]  Olle Häggström,et al.  Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes , 1999 .

[18]  J. Møller Perfect simulation of conditionally specified models , 1999 .