Introduces separable and essentially separable graphs as a broad class for mixed graphical models, provides multiple characterizations of the graphs and their separation equivalence, and develops an identification algorithm for equivalence classes.
On the Equivalence of Causal Models
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Scientists often use directed acyclic graphs (days) to model the qualitative structure of causal theories, allowing the parameters to be estimated from observational data. Two causal models are equivalent if there is no experiment which could distinguish one from the other. A canonical representation for causal models is presented which yields an efficient graphical criterion for deciding equivalence, and provides a theoretical basis for extracting causal structures from empirical data. This representation is then extended to the more general case of an embedded causal model, that is, a dag in which only a subset of the variables are observable. The canonical representation presented here yields an efficient algorithm for determining when two embedded causal models reflect the same dependency information. This algorithm leads to a model theoretic definition of causation in terms of statistical dependencies.
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Characterizing and Identifying Separable Graphical Models
Introduces separable and essentially separable graphs as a broad class for mixed graphical models, provides multiple characterizations of the graphs and their separation equivalence, and develops an identification algorithm for equivalence classes.