Back-door path

From Machinelearning
Revision as of 17:25, 2 June 2018 by IssaRice (talk | contribs) (Created page with "A '''back-door path''' in a causal graph is an indirect path with an arrow into the treatment variable. Formally, given a graph with nodes including <math>X</math> (treat...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

A back-door path in a causal graph is an indirect path with an arrow into the treatment variable.

Formally, given a graph with nodes including X (treatment variable) and Y (outcome variable), a direct path from X to Y is just a directed edge XY. An indirect path from X to Y is some traversal of edges from X to Y that isn't a direct path. Importantly, the edges don't have to be pointed in the "right way", so XZWY is an indirect path. A back-door path is an indirect path with an arrow into X.

Examples

XZY is a back-door path from XY

XZWY is not a back-door path from XY: it is an indirect path but there is no arrow into X