We start this paper by arguing that causality should, in analogy with force in Newtonian physics, be understood as a theoretical concept that is not explicated by a single definition, but by the axioms of a theory. Such an understanding of causality implicitly underlies the well-known theory of causal nets and has been explicitly promoted by Glymour. In this paper we investigate the explanatory warrant and empirical content of TCN. We sketch how the assumption of directed cause–effect relations can be (...) philosophically justified by an inference to the best explanation. We then ask whether the explanations provided by TCN are merely post-facto or have independently testable empirical content. To answer this question we develop a fine-grained axiomatization of TCN, including a distinction of different kinds of faithfulness. A number of theorems show that although the core axioms of TCN are empirically empty, extended versions of TCN have successively increasing empirical content. (shrink)

Within the causal modeling literature, debates about the Causal Faithfulness Condition have concerned whether it is probable that the parameters in causal models will have values such that distinct causal paths will cancel. As the parameters in a model are fixed by the probability distribution over its variables, it is initially puzzling what it means to assign probabilities to these parameters. I propose that to assign a probability to a parameter in a model is to treat that parameter as a (...) function of a variable in an augmented model. By combining this proposal with widely adopted principles regarding which variables must be included in a model, I argue that the various proposed counterexamples to CFC involving coordinated parameters are not genuine counterexamples. I then consider the cases in which CFC fails due not to coordination, but by coincidence, and propose explanatory and predictive bases for ruling out such coincidences without presuming that they are improbable. The aim of the proposed defenses is not to show that CFC never fails, but rather to argue that its use in a particular context may be defended using general modeling assumptions rather than by relying on claims about how often it fails. (shrink)

The framework of causal Bayes nets, currently influential in several scientific disciplines, provides a rich formalism to study the connection between causality and probability from an epistemological perspective. This article compares three assumptions in the literature that seem to constrain the connection between causality and probability in the style of Occam's razor. The trio includes two minimality assumptions—one formulated by Spirtes, Glymour, and Scheines (SGS) and the other due to Pearl—and the more well-known faithfulness or stability assumption. In terms of (...) logical strength, it is fairly obvious that the three form a sequence of increasingly stronger assumptions. The focus of this article, however, is to investigate the nature of their relative strength. The comparative analysis reveals an important sense in which Pearl's minimality assumption is as strong as the faithfulness assumption and identifies a useful condition under which it is as safe as SGS's relatively secure minimality assumption. Both findings have notable implications for the theory and practice of causal inference. 1 Introduction2 Background: Inference of Causal Structure in Markovian Causal Models3 Three Assumptions of Simplicity4 A Comparison of P-minimality and Faithfulness5 A Comparison of P-minimality and SGS-minimality6 Methodological Formulations and Prior Knowledge of Causal Order7 Conclusion. (shrink)

Much of the recent work on the epistemology of causation has centered on two assumptions, known as the Causal Markov Condition and the Causal Faithfulness Condition. Philosophical discussions of the latter condition have exhibited situations in which it is likely to fail. This paper studies the Causal Faithfulness Condition as a conjunction of weaker conditions. We show that some of the weaker conjuncts can be empirically tested, and hence do not have to be assumed a priori. Our results lead to (...) two methodologically significant observations: (1) some common types of counterexamples to the Faithfulness condition constitute objections only to the empirically testable part of the condition; and (2) some common defenses of the Faithfulness condition do not provide justification or evidence for the testable parts of the condition. It is thus worthwhile to study the possibility of reliable causal inference under weaker Faithfulness conditions. As it turns out, the modification needed to make standard procedures work under a weaker version of the Faithfulness condition also has the practical effect of making them more robust when the standard Faithfulness condition actually holds. This, we argue, is related to the possibility of controlling error probabilities with finite sample size (“uniform consistency”) in causal inference. (shrink)

Causal discovery becomes especially challenging when the possibility of latent confounding and/or selection bias is not assumed away. For this task, ancestral graph models are particularly useful in that they can represent the presence of latent confounding and selection effect, without explicitly invoking unobserved variables. Based on the machinery of ancestral graphs, there is a provably sound causal discovery algorithm, known as the FCI algorithm, that allows the possibility of latent confounders and selection bias. However, the orientation rules used in (...) the algorithm are not complete. In this paper, we provide additional orientation rules, augmented by which the FCI algorithm is shown to be complete, in the sense that it can, under standard assumptions, discover all aspects of the causal structure that are uniquely determined by facts of probabilistic dependence and independence. The result is useful for developing any causal discovery and reasoning system based on ancestral graph models. (shrink)

Recent approaches to causal modelling rely upon the causal Markov condition, which specifies which probability distributions are compatible with a directed acyclic graph. Further principles are required in order to choose among the large number of DAGs compatible with a given probability distribution. Here we present a principle that we call frugality. This principle tells one to choose the DAG with the fewest causal arrows. We argue that frugality has several desirable properties compared to the other principles that have been (...) suggested, including the well-known causal faithfulness condition. _1_ Introduction _2_ The Causal Markov Condition _3_ Faithfulness _4_ Frugality _4.1_ Basic independences and frugality _4.2_ General properties of directed acyclic graphs satisfying frugality _4.3_ Connection to minimality assumptions _5_ Frugality as a Parsimony Principle _6_ Conclusion Appendix. (shrink)

This dissertation aims to determine the optimal level of granularity for the variables used in probabilistic causal models. These causal models are useful for generating explanations in a number of scientific contexts. In Chapter 1, I argue that there is rarely a unique level of granularity at which a given phenomenon can be causally explained, thereby rejecting various causal exclusion arguments. In Chapter 2, I consider several recent proposals for measuring the explanatory power of causal explanations, and show that these (...) measures fail to track the comparative depth of explanations given at different levels of granularity. In Chapter 3, I offer a pragmatic account of how to partition the measure space of a causal variable so as to optimally explain its effect. My account uses the decision-theoretic notion of value of information, and indexes the relative depth of an explanation to a particular agent faced with a particular decision problem. Chapter 4 applies this same decisiontheoretic framework to answer the epistemic question of how to discover constitutive relationships in nature. In Chapter 5, I describe the formal details of the relationship between random variables that are meant to be coarse-grained and fine-grained representations of the same type of phenomenon. I use this formal framework to rebut a popular argument for the view that special science probabilities can be objective chances. Chapter 6 discusses challenges related to the causal interpretation of Bayes nets that use imprecise rather than precise probabilities. (shrink)

Casini, Illari, Russo, and Williamson (2011) suggest to model mechanisms by means of recursive Bayesian networks (RBNs) and Clarke, Leuridan, and Williamson (2014) extend their modelling approach to mechanisms featuring causal feedback. One of the main selling points of the RBN approach should be that it provides answers to questions concerning manipulation and control. In this paper I demonstrate that the method to compute the effects of interventions the authors mentioned endorse leads to absurd results under the additional assumption of (...) faithfulness, which can be expected to hold for many RBN models of mechanisms. (shrink)