Talk:Gibbs algorithm

Gibbs measure
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 (Unsigned, User:146.50.1.141, January 2007)
 * Now fixed. linas (talk) 21:16, 30 August 2008 (UTC)

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 = -\sum_i p_i \log p_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 op page 5/6. (Unsigned, User:146.50.1.141, January 2007) - On a similar note the article states $$H$$ is the 'average log probability'. The expression given (entropy) is the negative of that quantity. This makes the language about 'minimising the average log probability' confusing - since we should actually be maximising it. - Summary, I think there is a sign error. — Preceding unsigned comment added by 62.25.109.195 (talk) 11:54, 18 December 2013 (UTC)