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 →
What to know first
- causal pathA directed sequence of factors or variables through which changes can be transmitted from a cause to an outcome.
- confounderA confounder is a variable associated with both an explanatory or treatment variable and an outcome, whose influence can distort their apparent relationship or estimated causal effect.
- correlationCorrelation is a statistical association describing how variables vary together in direction or degree, without by itself establishing causation.
- directed acyclic graphA directed acyclic graph is a graph whose edges have directions and contain no directed cycles.
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 whose edges have directions and contain no directed cycles.
- 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.
- 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.
- 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.
- parallel world graphcontrasts with · A parallel world graph is a graph representation that places variables from multiple counterfactual worlds together without necessarily permitting the same separation relations as a counterfactual graph.
Questions about d-separation
What is 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.
Which Manning books explain d-separation?
Causal AI and Causal Inference for Data Science.
What should I know before learning d-separation?
Manning books that teach d-separation usually introduce causal path, confounder, correlation and directed acyclic graph first.
What is the difference between d-separation and conditional independence?
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. Two variables are conditionally independent given specified information when their conditional joint distribution factors into the product of their conditional distributions.
What is d-separation part of?
D-separation is part of backdoor criterion. 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.
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.

