A weaker structural Markov property for decomposable graph laws

We present a new kind of structural Markov property for probabilistic laws on decomposable graphs, prove the equivalence of an exponential family assumption, and discuss identifiability, modelling and computational implications.