On Deducing Conditional Independence from d-Separation in Causal Graphs with Feedback

32Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Neal, R. M. (2000). On Deducing Conditional Independence from d-Separation in Causal Graphs with Feedback. Journal of Artificial Intelligence Research, 12, 87. https://doi.org/10.1613/jair.689

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free