Causal reasoning is primarily concerned with what would happen to a system under external interventions. In particular, we are often interested in predicting the probability distribution of some random variables that would result if some other variables were forced to take certain values. One prominent approach to tackling this problem is based on causal Bayesian networks, using directed acyclic graphs as causal diagrams to relate post-intervention probabilities to pre-intervention probabilities that are estimable from observational data. However, such causal diagrams are (...) seldom fully testable given observational data. In consequence, many causal discovery algorithms based on data-mining can only output an equivalence class of causal diagrams. This paper is concerned with causal reasoning given an equivalence class of causal diagrams, represented by a ancestral graph. We present two main results. The first result extends Pearl 's celebrated do-calculus to the context of ancestral graphs. In the second result, we focus on a key component of Pearl's calculus---the property of invariance under interventions, and give stronger graphical conditions for this property than those implied by the first result. The second result also improves the earlier, similar results due to Spirtes et al. (shrink)

In (Gebharter 2014) I suggested a framework for modeling the hierarchical organization of mechanisms. In this short addendum I want to highlight some connections of my approach to the statistics and machine learning literature and some of its limitations not mentioned in the paper.

An empirical procedure is suggested for testing a model that postulates variables that intervene between observed causes and abserved effects against a model that includes no such postulate. The procedure is applied to two experiments in psychology. One involves a conditioning regimen that leads to response generalization; the other concerns the question of whether chimpanzees have a theory of mind.

This paper introduces a class of graphical independence models that is closed under marginalization and conditioning but that contains all DAG independence models. This class of graphs, called maximal ancestral graphs, has two attractive features: there is at most one edge between each pair of vertices; every missing edge corresponds to an independence relation. These features lead to a simple parameterization of the corresponding set of distributions in the Gaussian case.

In this article I tackle the question of how the hierarchical order of mechanisms can be represented within a causal graph framework. I illustrate an answer to this question proposed by Casini, Illari, Russo, and Williamson and provide an example that their formalism does not support two important features of nested mechanisms: (i) a mechanism’s submechanisms are typically causally interacting with other parts of said mechanism, and (ii) intervening in some of a mechanism’s parts should have some influence on the (...) phenomena the mechanism brings about. Finally, I sketch an alternative approach taking (i) and (ii) into account. (shrink)