| Gibbs Sampling |
Article Index for Gibbs |
Website Links For Gibbs |
Information AboutGibbs Sampling |
| CATEGORIES ABOUT GIBBS SAMPLING | |
| monte carlo methods | |
|
and thus an example of a Markov Chain Monte Carlo algorithm. The algorithm is named after the physicist J. W. Gibbs , in reference to an analogy between the Sampling algorithm and Statistical Physics . The algorithm was devised by Geman and Geman (citation below), some eight decades after the passing of Gibbs, and is also called the ''Gibbs sampler''. Gibbs sampling is applicable when the joint distribution is not known explicitly, but the Conditional Distribution of each variable is known. The Gibbs sampling algorithm is to generate an instance from the distribution of each variable in turn, conditional on the current values of the other variables. It can be shown (see, for example, Gelman et al.) that the sequence of samples comprises a Markov Chain , and the stationary distribution of that Markov chain is just the sought-after joint distribution. Gibbs sampling is particularly well-adapted to sampling the Posterior Distribution of a Bayesian Network , since Bayesian networks are typically specified as a collection of conditional distributions. BUGS (link below) is a program for carrying out Gibbs sampling on Bayesian networks. IMPLEMENTATION |
|
|