Talks

Based on the immense popularity of causal Bayesian networks and structural causal models, one might expect that these representations are appropriate to describe the causal semantics of any real-world system, at least in principle. In this talk, I will argue that this is not the case, and motivate the study of more general causal modeling frameworks. In particular, I will discuss bipartite graphical causal models. Real-world complex systems are often modelled by systems of equations with endogenous and independent exogenous random variables. Such models have a long tradition in physics and engineering. The structure of such systems of equations can be encoded by a bipartite graph, with variable and equation nodes that are adjacent if a variable appears in an equation. I will show how one can use Simon’s causal ordering algorithm and the Dulmage-Mendelsohn decomposition to derive a Markov property that states the conditional independence for (distributions of) solutions of the equations in terms of the bipartite graph. I will then show how this Markov property gives rise to a do-calculus for bipartite graphical causal models, providing these with a refined causal interpretation.

In the Statistics literature there are three main frameworks for causal modeling: counterfactuals (aka potential outcomes), non-parametric structural equation models (NPSEMs) and graphs (aka path diagrams or causal Bayes nets). These approaches are similar and, in certain specific respects, equivalent. However, there are important conceptual differences and each formulation has its own strengths and weaknesses. These divergences are of relevance both in theory and when the approaches are applied in practice. This talk will introduce the different frameworks, and describe, through examples, both the commonalities and dissimilarities. In particular, we will see that the “default” assumptions within these frameworks lead to different identification results when quantifying mediation and, more generally, path-specific effects.