Photo from academic.microsoft.com
This article surveys the variety of ways in which a directed acyclic graph (DAG) can be used to represent a problem of probabilistic causality. For each of these ways, we… Click to show full abstract
This article surveys the variety of ways in which a directed acyclic graph (DAG) can be used to represent a problem of probabilistic causality. For each of these ways, we describe the relevant formal or informal semantics governing that representation. It is suggested that the cleanest such representation is that embodied in an augmented DAG, which contains nodes for non-stochastic intervention indicators in addition to the usual nodes for domain variables.
Keywords:
graph;
causal graph
Journal Title: Algorithms
Year Published: 2024
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Algorithms
Year Published: 2024
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!