Backdoor-connected

CPDAG

A rule table that finds all nodes that are reachable from set $X$ via a proper definite-status path open given $W$ that does not start with an edge to a node in $C$ in a completed partially directed acyclic graph (CPDAG). We use this for verifying the adjustment criterion (Perković et al. 2018) for CPDAGs where $C$ is the set of nodes on a causal path between $X$ and the set of outcome variables $Y$ .

EDGES --> <--, ---
SETS X, C, W
START <-- AT X
OUTPUT ...

--> | <-- | current in W
--- | --- | current not in W
... | --> | current not in W and (current not in X or next not in C)
<-- | ... | current not in W

Graph type:

CPDAG

Applications:

Verifying adjustment sets

References:

Perković et al. (2018)