y0 icon indicating copy to clipboard operation
y0 copied to clipboard

Implement the cyclic ID (ioID) algorithm

Open cthoyt opened this issue 4 years ago • 0 comments

This is an extension of the ID algorithm to graphs containing cycles as described in

Causal Calculus in the Presence of Cycles, Latent Confounders and Selection Bias Patrick Forré, Joris M. Mooij (2019) https://arxiv.org/abs/1901.00433v2

Depends on:

  • m-separation for ADMGs (this is a special case of d-separation, #29/#135)
  • sigma-separation for directed cyclic mixed graphs (#120)

cthoyt avatar Jun 30 '21 21:06 cthoyt