Kybernetika

Perez's approximations of probability distributions by dependence structure simplification were introduced in 1970s, much earlier than graphical Markov models. In this paper we will recall these Perez's models, formalize the notion of a compatible system of elementary simplifications and show the necessary and sufficient conditions a system must fulfill to be compatible. For this we will utilize the apparatus of compositional models.