pith. sign in

arxiv: 1304.1108 · v1 · pith:6WNFYWHInew · submitted 2013-03-27 · 💻 cs.AI

On the Equivalence of Causal Models

classification 💻 cs.AI
keywords causalmodelsmodelrepresentationalgorithmcanonicaldataefficient
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.