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.
The no unmeasured confounding assumption is the conditional exchangeability statement
Also assume consistency of potential outcomes, no interference between units, and positivity in causal inference, in particular on the covariate support of treated units. Then
The first treated potential outcome equals the observed treated mean by consistency. Moreover,
Subtracting proves the displayed identification formula for the average treatment effect on the treated.
For discrete ,
Perturbing the marginal mass contributes . Perturbing contributes
Their sum is . Finally, the influence function of
is
Multiplication by the derivative of with respect to and summation over gives
Adding the three contributions yields the claimed mean-zero influence curve
Estimate the propensity score and the untreated outcome regression , preferably with cross-fitting when flexible methods are used, and set
With , the resulting one-step estimator of the ATT is
Equivalently,
This is an augmented inverse-probability-weighted estimator; it is consistent when either the propensity model or the untreated outcome model is correct, subject to the usual regularity and positivity conditions.
The graph factorizes as
Conditioning on all variables except , terms not involving cancel, leaving
This depends only on , so
Thus is a Markov blanket of .
For a distribution faithful to a Directed acyclic graph, the smallest Markov blanket of a vertex consists of
  • its parents,
  • its children, and
  • every other parent of one of its children.
Conditioning on this set blocks every path from the vertex to all remaining vertices. Each listed neighbor is necessary under faithfulness of a directed acyclic graph: omitting a parent or child leaves its direct edge active, while omitting a child's other parent leaves the collider path through that conditioned child active. Faithfulness rules out accidental cancellations that could otherwise make a smaller blanket sufficient.
Conditional independence means that, for almost every ,
equivalently wherever the conditional probabilities are defined.
Now use the chain rule and both assumed independences:
This is exactly , proving the contraction axiom for conditional independence.
Let be a Markov blanket of the treatment inside , and write the remaining adjustment variables as . By definition,
The sufficiency of gives
Apply the contraction axiom for conditional independence with first variable , second variable , third variable , and conditioning variable . It gives
The decomposition axiom for conditional independence then yields . Hence every Markov blanket of in is itself a sufficient adjustment set.
The instrumental variable graph is
with no arrow and no common cause of with or .
In potential outcome notation, a valid instrument requires:
Instrumental-variable monotonicity is
It excludes defiers who would quit without the incentive but continue smoking when offered it. The possible principal strata are then never-takers , compliers , and always-takers .
By random assignment, consistency, and exclusion,
The second identity follows by checking the two possible binary exposure values. Under monotonicity, is the indicator of being a complier. Therefore the numerator is
while
Their ratio is the complier average treatment effect, also called the local average treatment effect.
Let
and
Because contains all exposure-outcome confounding and is independent of , the exclusion restriction and the law of total expectation give
Likewise,
The no confounder-instrument interaction assumption says is constant. Relevance gives , so the Wald ratio is
the overall average treatment effect.

Articles by others on the same topic (0)

There are currently no matching articles.