Back-door path: Difference between revisions

From Machinelearning
No edit summary
No edit summary
Line 7: Line 7:
<math>X \leftarrow Z \to Y</math> is a back-door path from <math>X</math> to <math>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</math> to <math>Y</math>: it is an indirect path but there is no arrow into <math>X</math>.

Revision as of 17:26, 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 (treatment variable) and (outcome variable), a direct path from to is just a directed edge . An indirect path from to is some traversal of edges from to that isn't a direct path. Importantly, the edges don't have to be pointed in the "right way", so is an indirect path. A back-door path is an indirect path with an arrow into .

Examples

is a back-door path from to .

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