Let be independent random variables, each with a Bernoulli distribution of parameter , and put . Unconditionally, the four ordered pairs each have probability . On the event , only and remain, each with conditional probability . Thus
Knowing that exactly one trial succeeded makes observing one outcome informative about the other. This violates conditional independence given , even though the original random variables are independent. Given or , both variables are constant random variables and are conditionally independent there; that does not repair the failure at , an event of positive probability.
Figure 1.
Selecting pairs with exactly one success makes independent trials dependent
. Left: four equally probable outcomes of independent fair Bernoulli trials. The selection retains exactly two pairs. Right: their conditional joint table has zero mass on the diagonal and off it. Within this selected model the conditional covariance is ; the two conditional marginal distributions remain fair. Details.
The conditional covariance here is . Both conditional variances are , so the conditional correlation coefficient is : within the selected group, . These conclusions follow from restricting a finite sample space, without positing any physical interaction between the trials.
This example and the shared-environment example establish both logical directions: independent random variables need not be conditionally independent, and conditionally independent variables need not be independent. When is represented as the joint result of two inputs in a causal directed acyclic graph, conditioning on it has the collider structure associated with collider bias. A probability calculation by itself establishes a dependence relation, not a physical causal mechanism or an intervention.
Under the displayed causal directed acyclic graphs, with nonzero effects along the relevant arrows and no exact cancellation of the effects on , the valid instrumental variables are scenarios (i), (ii), and (iv). The path arguments are:
An upstream intermediate variable need not invalidate an instrumental variable if its routes to the outcome all pass through the target exposure; an outcome intermediate reached without that exposure does invalidate it.
In the second causal directed acyclic graph, depends on but not on , whereas depends on and the two latent roots are independent. Hence
Although conditioning on conveys information about , the assignment uses only and fresh randomization, so
These are the two sequential exchangeability conditions. Using them successively, together with consistency of potential outcomes, gives
which is the formula from part a.
Adding invalidates the argument in general. The latent variable confounds and , so need not equal the distribution of . When directly affects , that discrepancy no longer cancels after summing over . The same observed distribution can then correspond to different intervention means, so the displayed formula need not identify the effect.
Let be the genetic instrument, vitamin-D concentration, an unmeasured cause of vitamin D and mortality, and mortality. The causal directed acyclic graph contains
Although and are marginally independent, is a collider. Conditioning on opens the path , violating instrumental-variable independence within the resulting strata. Residual exposure stratification instead removes the component of predicted by before stratification; under the additive first-stage model, the stratifying variable is no longer caused by .
Take all components to be centered and let their marginal variances be . A linear structural equation model is
where are mutually independent and the are identically distributed. The causal directed acyclic graph has arrows
For monozygotic twins, set with ; the genetic cause is completely shared. For dizygotic twins, one explicit construction is
where are independent with variance . Then both additive genetic terms have variance , while their covariance is and their correlation coefficient is . In a fuller graph, the shared points to both genetic components and the unique points only to its own component.
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.
A minimal causal directed acyclic graph has edges