# AP Statistics Curriculum 2007 Bayesian Gibbs

(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Gibbs sampling is an algorithm to generate a sequence of samples from the joint probability distribution of two or more random variables. The purpose of this sequence is to approximate the joint distribution, or to compute an expected value. Gibbs sampling is a special case of the Metropolis-Hastings algorithm also making it an example of a Markov chain Monte Carlo algorithm.