In statistics, econometrics, epidemiology, genetics and related disciplines, causal graphs (also known as path diagrams, causal Bayesian networks or DAGs) are probabilistic graphical models used to encode assumptions about the data-generating process. They can also be viewed as a blueprint of the algorithm by which Nature assigns values to the variables in the domain of interest.
Causal graphs can be used for communication and for inference. As communication devices, the graphs provide formal and transparent representation of the causal assumptions that researchers may wish to convey and defend. As inference tools, the graphs enable researchers to estimate effect sizes from non-experimental data, derive testable implications of the assumptions encoded, test for external validity, and manage missing data and selection bias.
Causal graphs were first used by the geneticist Sewall Wright under the rubric "path diagrams". They were later adopted by social scientists and, to a lesser extent, by economists. These models were initially confined to linear equations with fixed parameters. Modern developments have extended graphical models to non-parametric analysis, and thus achieved a generality and flexibility that has transformed causal analysis in computer science, epidemiology, and social science.
Construction and terminologyEdit
The causal graph can be drawn in the following way. Each variable in the model has a corresponding vertex or node and an arrow is drawn from a variable X to a variable Y whenever Y is judged to respond to changes in X when all other variables are being held constant. Variables connected to Y through direct arrows are called parents of Y, or "direct causes of Y," and are denoted by Pa(Y).
Causal models often include "error terms" or "omitted factors" which represent all unmeasured factors that influence a variable Y when Pa(Y) are held constant. In most cases, error terms are excluded from the graph. However, if the graph author suspects that the error terms of any two variables are dependent (e.g. the two variables have an unobserved or latent common cause) then a bidirected arc is drawn between them. Thus, the presence of latent variables is taken into account through the correlations they induce between the error terms, as represented by bidirected arcs.
A fundamental tool in graphical analysis is d-separation, which allows researchers to determine, by inspection, whether the causal structure implies that two sets of variables are independent given a third set. In recursive models without correlated error terms (sometimes called Markovian), these conditional independences represent all of the model's testable implications.
Suppose we wish to estimate the effect of attending an elite college on future earnings. Simply regressing earnings on college rating will not give an unbiased estimate of the target effect because elite colleges are highly selective, and students attending them are likely to have qualifications for high-earning jobs prior to attending the school. Assuming that the causal relationships are linear, this background knowledge can be expressed in the following structural equation model (SEM) specification.
where represents the individual's qualifications prior to college, represents qualifications after college, contains attributes representing the quality of the college attended, and the individual's salary.
Figure 1 is a causal graph that represents this model specification. Each variable in the model has a corresponding node or vertex in the graph. Additionally, for each equation, arrows are drawn from the independent variables to the dependent variables. These arrows reflect the direction of causation. In some cases, we may label the arrow with its corresponding structural coefficient as in Figure 1.
If and are unobserved or latent variables their influence on and can be attributed to their error terms. By removing them, we obtain the following model specification:
The background information specified by Model 1 imply that the error term of , , is correlated with C's error term, . As a result, we add a bidirected arc between S and C, as in Figure 2.
Since is correlated with and, therefore, , is endogenous and is not identified in Model 2. However, if we include the strength of an individual's college application, , as shown in Figure 3, we obtain the following model:
By removing the latent variables from the model specification we obtain:
with correlated with .
Now, is identified and can be estimated using the regression of on and . This can be verified using the single-door criterion, a necessary and sufficient graphical condition for the identification of a structural coefficients, like , using regression.
- Pearl, Judea (2000). Causality. Cambridge, MA: MIT Press.
- Tian, Jin; Pearl, Judea (2002). "A general identification condition for causal effects". Proceedings of the Eighteenth National Conference on Artificial Intelligence. ISBN 978-0-262-51129-2.
- Shpitser, Ilya; Pearl, Judea (2008). "Complete Identification Methods for the Causal Hierarchy" (PDF). Journal of Machine Learning Research. 9: 1941–1979.
- Huang, Y.; Valtorta, M. (2006). "Identifiability in causal bayesian networks: A sound and complete algorithm". Proceedings of AAAI.
- Bareinboim, Elias; Pearl, Judea (2012). "Causal Inference by Surrogate Experiments: z-Identifiability". Proceedings of the Twenty-Eighth Conference on Uncertainty in Artificial Intelligence. arXiv:1210.4842. Bibcode:2012arXiv1210.4842B. ISBN 978-0-9749039-8-9.
- Tian, Jin; Pearl, Judea (2002). "On the Testable Implications of Causal Models with Hidden Variables". Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence. pp. 519–27. arXiv:1301.0608. Bibcode:2013arXiv1301.0608T. ISBN 978-1-55860-897-9.
- Shpitser, Ilya; Pearl, Judea (2008). "Dormant Independence". Proceedings of AAAI.
- Chen, Bryant; Pearl, Judea (2014). "Testable Implications of Linear Structural Equation Models". Proceedings of AAAI.
- Bareinmboim, Elias; Pearl, Judea (2014). "External Validity: From do-calculus to Transportability across Populations". Statistical Science. 29 (4): 579–595. arXiv:1503.01603. doi:10.1214/14-sts486.
- Mohan, Karthika; Pearl, Judea; Tian, Jin (2013). "Graphical Models for Inference with Missing Data". Advances in Neural Information Processing Systems.
- Bareinboim, Elias; Tian, Jin; Pearl, Judea (2014). "Recovering from Selection Bias in Causal and Statistical Inference". Proceedings of AAAI.
- Wright, S. (1921). "Correlation and causation". Journal of Agricultural Research. 20: 557–585.
- Blalock, H. M. (1960). "Correlational analysis and causal inferences". American Anthropologist. 62 (4): 624–631. doi:10.1525/aa.1960.62.4.02a00060.
- Duncan, O. D. (1966). "Path analysis: Sociological examples". American Journal of Sociology. 72: 1–16. doi:10.1086/224256.
- Duncan, O. D. (1976). "Introduction to structural equation models". American Journal of Sociology. 82 (3): 731–733. doi:10.1086/226377.
- Jöreskog, K. G. (1969). "A general approach to confirmatory maximum likelihood factor analysis". Psychometrika. 34 (2): 183–202. doi:10.1007/bf02289343.
- Goldberger, A. S.; Duncan, O. D. (1973). Structural equation models in the social sciences. New York: Seminar Press.
- Goldberger, A. S. (1972). "Structural equation models in the social sciences". Econometrica. 40 (6): 979–1001. doi:10.2307/1913851. JSTOR 1913851.
- White, Halbert; Chalak, Karim; Lu, Xun (2011). "Linking granger causality and the pearl causal model with settable systems". Causality in Time Series Challenges in Machine Learning. 5.
- Rothman, Kenneth J.; Greenland, Sander; Lash, Timothy (2008). Modern epidemiology. Lippincott Williams & Wilkins.
- Morgan, S. L.; Winship, C. (2007). Counterfactuals and causal inference: Methods and principles for social research. New York: Cambridge University Press.
- Geiger, Dan; Pearl, Judea (1993). "Logical and Algorithmic Properties of Conditional Independence". Annals of Statistics. 21 (4): 2001–2021. CiteSeerX 10.1.1.295.2043. doi:10.1214/aos/1176349407.
- Chen, B.; Pearl, J (2014). "Graphical Tools for Linear Structural Equation Modeling". Technical Report.