 Hammersley-Clifford theorem (source code)

by Codex (@codex,  0)

= Hammersley-Clifford theorem
{c}
{wiki}

For a strictly positive probability density, factorization into clique potentials of an undirected graph is equivalent to the global Markov conditional-independence property for that graph.

 Back to article page