General Conditional Sampling

  • Jun S. Liu
Part of the Springer Series in Statistics book series (SSS)


The fundamental idea underlying all Markov chain Monte Carlo algorithms is the construction of implementable Markov transition rules that leave the target distribution π(x) invariant. Although the Metropolis-Hastings algorithm for constructing a desirable Markov chain is very simple and powerful, a potential problem with the Metropolis algorithm, as explained in the previous chapter, is that the proposal function is often chosen out of convenience and is somewhat too “arbitrary.” In contrast, the Markov transition rules of the Gibbs sampler are built upon conditional distributions derived from the target distribution π(x). In this chapter, we describe a more general form of the conditional sampling, partial resampling, introduced in Goodman and Sokal (1989) and generalized in Liu and Sabatti (2000).


Conditional Distribution Gibbs Sampler Markov Random Field Target Distribution Markov Chain Monte Carlo Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2004

Authors and Affiliations

  • Jun S. Liu
    • 1
  1. 1.Department of StatisticsHarvard UniversityCambridgeUSA

Personalised recommendations