Closure

ADMG

Computes the closure of a set of nodes $X$ with respect to conditioning set $Z$ and ancestors $A$ . It can be used to find a nearest d-separator as described by van der Zander, Liśkiewicz (2020).

EDGES --> <--, <->
SETS X, Z, A
START <-- AT X
OUTPUT ...

-->, <-> | <--, <-> | next in A
...      | ...      | next in A and current not in Z

Graph type:

ADMG

Applications:

Finding minimal d-separators, Finding conditional instruments

References:

van der Zander, Liśkiewicz (2020)