D-separation
D-separation is a graphical criterion for determining whether a conditioning set blocks all relevant paths between variables in a graph, implying conditional independence under the graph’s assumptions.
Causal AI
D-separation is a graphical criterion for determining whether conditioning on variables blocks all paths of statistical or causal association in a directed acyclic graph.
- How it is used
- Checks DAG-implied conditional independence to choose adjustment sets and seek evidence that refutes a causal model.
- How deep it goes
- Defines path-level blocking rules, works through multiple paths and collider side effects, and checks candidate sets in Python.
- Examples
- Uses chain and collider diagrams, multi-path blocking sets, a gaming intervention, and a NetworkX check of a pgmpy DAG.
- What you can do after
- Apply it via NetworkX and pgmpy to check conditioning sets and challenge DAG assumptions before causal estimation.
Causal Inference for Data Science
D-separation is a graphical criterion stating that a conditioning set blocks the relevant paths between variables in a graph, implying their conditional independence under the graph's assumptions.
- How it is used
- Guides adjustment-variable selection for estimating causal effects in complex DAGs.
- How deep it goes
- Defines path-blocking rules for chains, forks, colliders, and collider descendants, then applies them to back-door adjustment.
- Examples
- Uses Jane and Joe’s train delays and a three-path X–Y graph with causal, confounding, and collider paths.
- What you can do after
- Evaluate/understand whether a conditioning set blocks paths and supports back-door adjustment planning.
Read how Causal Inference for Data Science explains d-separation →
Related concepts
- conditional independencecontrasts with · Two variables are conditionally independent given specified information when their conditional joint distribution factors into the product of their conditional distributions.
- directed acyclic graphuses · A directed acyclic graph is a graph with directed edges and no directed cycles.
- graph surgeryused by · Graph surgery is the modification of a causal graph to represent an intervention by changing or removing the intervened variable's incoming causal edges.
- causal graphical modelproduced by · A causal graphical model is a probabilistic or structural model whose graph represents causal relationships and whose mechanisms support reasoning about interventions.
- backdoor criterionpart of · The backdoor criterion is a graphical condition for identifying a causal effect by requiring a variable set to block every backdoor path while excluding treatment descendants.
- statistical independence testuses · A statistical independence test is a hypothesis-testing procedure that evaluates whether variables are statistically independent or conditionally independent based on observed data.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.