Sections1,1.2 and1.3 state the path criterion, blocking by conditioned noncolliders and activation by conditioning on a collider or its descendant.
Judea Pearl 2026-11-05
Judea Pearl developed graphical methods for probabilistic and causal reasoning. His account of D-separation explains how the orientation of arrows in a directed acyclic graph determines conditional independences implied by its factorization assumptions.[ref]
For a chain , conditioning on blocks the path. For a collider , the path is blocked before conditioning, but conditioning on or an appropriate descendant can activate it. A graphical separation guarantees independence for distributions obeying the graph's assumptions; an unblocked path does not force dependence in every numerical parameterization. These distinctions make the graph a reasoning tool rather than just a picture of observed correlations.