On Deducing Conditional Independence from d-Separation in Causal Graphs with Feedback (Research Note)

06/01/2011
by   R. M. Neal, et al.
0

Pearl and Dechter (1996) claimed that the d-separation criterion for conditional independence in acyclic causal networks also applies to networks of discrete variables that have feedback cycles, provided that the variables of the system are uniquely determined by the random disturbances. I show by example that this is not true in general. Some condition stronger than uniqueness is needed, such as the existence of a causal dynamics guaranteed to lead to the unique solution.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2013

Identifying Independencies in Causal Graphs with Feedback

We show that the d -separation criterion constitutes a valid test for co...
research
08/06/2021

Topological Conditional Separation

Pearl's d-separation is a foundational notion to study conditional indep...
research
03/27/2013

On the Logic of Causal Models

This paper explores the role of Directed Acyclic Graphs (DAGs) as a repr...
research
08/06/2021

Causal Inference Theory with Information Dependency Models

Inferring the potential consequences of an unobserved event is a fundame...
research
10/05/2020

Is Information Theory Inherently a Theory of Causation?

Information theory gives rise to a novel method for causal skeleton disc...
research
02/22/2022

Relational Causal Models with Cycles:Representation and Reasoning

Causal reasoning in relational domains is fundamental to studying real-w...
research
06/15/2020

p-d-Separation – A Concept for Expressing Dependence/Independence Relations in Causal Networks

Spirtes, Glymour and Scheines formulated a Conjecture that a direct depe...

Please sign up or login with your details

Forgot password? Click here to reset