A structural Markov property for decomposable graph laws that allows control of clique intersections

Peter J Green, Alun Thomas
2017 Biometrika  
General rights This document is made available in accordance with publisher policies. Please cite only the published version using the reference above. Full terms of use are available: SUMMARY We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, which allows the explicit control of interactions between cliques and so is capable of encoding some interesting structure. We prove the equivalence of this property to an exponential family assumption, and
more » ... ly assumption, and discuss identifiability, modelling, inferential and computational implications.
doi:10.1093/biomet/asx072 fatcat:4e6pxvg4yjdfho7kluvym3gjom