{"articles":{"hammersley-clifford-theorem@graphical-networks":{"content":"<p>If the undirected graph \\({\\mathcal{H}}\\) is an independence map for positive \\(P\\), then \\(P\\) is a Gibbs distribution that factorizes over \\({\\mathcal{H}}\\). <br> (If \\({\\mathcal{H}}\\) encodes independences between variables that are actually dependent in \\(P\\), \\(P\\) does not factorize according to \\({\\mathcal{H}}\\).)</p>","names":[[["Hammersley–Clifford theorem",""]]]}},"style":"Statement"}