Linear network coding

From formulasearchengine
Revision as of 14:28, 1 January 2014 by en>Ali fa1360 (References)
Jump to navigation Jump to search

In mathematics, the Gibbs measure, named after Josiah Willard Gibbs, is a probability measure frequently seen in many problems of probability theory and statistical mechanics. It is the measure associated with the canonical ensemble. Gibbs measure implies the Markov property (a certain kind of statistical independence); and importantly, it implies the Hammersley–Clifford theorem that the energy function can be written as a multiplication of parts, thus leading to its widespread appearance in many problems outside of physics, such as Hopfield networks, Markov networks, and Markov logic networks. In addition, the Gibbs measure is the unique measure that maximizes the entropy for a given expected energy; thus, the Gibbs measure underlies maximum entropy methods and the algorithms derived therefrom.

The measure gives the probability of the system X being in state x (equivalently, of the random variable X having value x) as

P(X=x)=1Z(β)exp(βE(x)).

Here, E(x) is a function from the space of states to the real numbers; in physics applications, E(x) is interpreted as the energy of the configuration x. The parameter β is a free parameter; in physics, it is the inverse temperature. The normalizing constant Z(β) is the partition function.

Markov property

An example of the Markov property of the Gibbs measure can be seen in the Ising model. Here, the probability of a given spin σk being in state s is, in principle, dependent on all other spins in the model; thus one writes

P(σk=s|σj,jk)

for this probability. However, the interactions in the Ising model are nearest-neighbor interactions, and thus, one actually has

P(σk=s|σj,jk)=P(σk=s|σj,jNk)

where Nk is the set of nearest neighbors of site k. That is, the probability at site k depends only on the nearest neighbors. This last equation is in the form of a Markov-type statistical independence. Measures with this property are sometimes called Markov random fields. More strongly, the converse is also true: any positive probability distribution (non-zero everywhere) having the Markov property can be represented with the Gibbs measure, given an appropriate energy function;[1] this is the Hammersley–Clifford theorem.

Gibbs measure on lattices

What follows is a formal definition for the special case of a random field on a group lattice. The idea of a Gibbs measure is, however, much more general than this.

The definition of a Gibbs random field on a lattice requires some terminology:

  • The lattice: A countable set 𝕃.
  • The set of all finite subsets of 𝕃.
HΛΦ(ω|ω¯)=HΛΦ(ωΛω¯Λc),
where Λc=𝕃Λ.
ZΛΦ(ω¯)=λΛ(dω)exp(βHΛΦ(ω|ω¯)).
Here λΛ(dω) is the product measure tΛλ(dω(t)).
A potential Φ is λ-admissible if ZΛΦ(ω¯) is finite for all Λ, ω¯Ω and β>0.

A probability measure μ on (Ω,) is a Gibbs measure for a λ-admissible potential Φ if it satisfies the Dobrushin-Lanford-Ruelle (DLR) equations

μ(dω¯)ZΛΦ(ω¯)1λΛ(dω)exp(βHΛΦ(ω|ω¯))1A(ωΛω¯Λc)=μ(A),
for all A and Λ.

An example

To help understand the above definitions, here are the corresponding quantities in the important example of the Ising model with nearest-neighbour interactions (coupling constant J) and a magnetic field (h), on d:

  • The lattice is simply 𝕃=d.
  • The single-spin space is S={1,1}.
  • The potential is given by
ΦA(ω)={Jω(t1)ω(t2)ifA={t1,t2}witht2t11=1hω(t)ifA={t}0otherwise

See also

References

  1. Ross Kindermann and J. Laurie Snell, Markov Random Fields and Their Applications (1980) American Mathematical Society, ISBN 0-8218-5001-6
  • Georgii, H.-O. "Gibbs measures and phase transitions", de Gruyter, Berlin, 1988, 2nd edition 2011.

Template:Stochastic processes