Talk:Gibbs algorithm

From Wikipedia, the free encyclopedia

WikiProject Physics This article is within the scope of WikiProject Physics, which collaborates on articles related to physics.
??? This article has not yet received a rating on the assessment scale. [FAQ]
??? This article has not yet received an importance rating within physics.

Help with this template Please rate this article, and then leave comments to explain the ratings and/or to identify its strengths and weaknesses.

This page mentions two things: The Gibbs Algorithm and the Gibbs Distribution. In my opinion, both are important and should be separated. According to various Markov Random Field literature, the Gibbs distribution takes the form of:

P(f) = Z^{-1} \times e^{-\frac{1}{T} U(f)}

where

Z = \sum_{f \in F} e^{-\frac{1}{T} U(f)}

is a normalizing factor. T is a constant called the temperature, and U(f) is an energy function. For a specific choice of U(f), this leads to the (Gaussian) Normal_distribution.

Maybe the Gibbs distrubution should redirect to the Gibbs_measure

[edit] Gibbs Algorithm vs Gibbs Sampler

This article states that the Gibbs Algorithm is different from the Gibbs Sampler. But I encountered various interpretations of Markov Random Fields in terms of maximizing the Entropy, which is often defined as

H = − ∑ pilogpi
i

This makes the Gibbs algorithm probably a special case of Markov chain Monte Carlo iterations. For an interpretation of Markov Random Fields in terms of Entropy see for example here [1] op page 5/6.