A path in a causal directed acyclic graph is active given a conditioning set when every noncollider on the path is outside and every collider has itself or a descendant in . Two vertex sets are d-separated by when no path between them is active given . The global Markov property of a directed acyclic graph then turns d-separation into conditional independence.
In the displayed graph, the edges are
Every observed pair except and is joined by a direct edge, which remains active under conditioning on any other observed variables. The pair is always joined by the fork , because the unobserved noncollider cannot be conditioned on.
For , if is not conditioned on, is active. If is conditioned on, the path
becomes active because its collider has conditioned descendant ; conditioning on itself also opens it. Thus every observed pair is d-connected given every subset of the other observed variables. Any conditional independence between two nonempty observed subvectors would imply one between each selected pair, so the graph entails none.
The directed acyclic graph factorization is
The graph gives and . Therefore Bayes theorem gives
Consequently
which contains no . This observed equality is a Verma constraint: it is implied by the latent-variable causal graph even though it is not a conditional independence.
Write
Since has no parents, its total effect has no backdoor path, and
For , intercepts every directed path to . Conditional on , there is no unblocked backdoor path from to , and blocks every backdoor path from to . The conditional front-door adjustment therefore gives
and
Part ii shows that the inner sum, after also averaging , does not actually depend on .
For , is a sufficient backdoor adjustment set. Hence
These three formulas identify the requested average treatment effects from the observed joint distribution.

Articles by others on the same topic (0)

There are currently no matching articles.