Back-door path: Difference between revisions

From Machinelearning
(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...")
 
No edit summary
Line 5: Line 5:
==Examples==
==Examples==


<math>X \leftarrow Z \to Y</math> is a back-door path from <math>X \to Y</math>
<math>X \leftarrow Z \to Y</math> is a back-door path from <math>X</math> to <math>Y</math>.


<math>X \to Z \leftarrow W \to Y</math> is not a back-door path from <math>X \to Y</math>: it is an indirect path but there is no arrow into <math>X</math>
<math>X \to Z \leftarrow W \to Y</math> is not a back-door path from <math>X \to Y</math>: it is an indirect path but there is no arrow into <math>X</math>.

Revision as of 17:25, 2 June 2018

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 X to Y.

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