Note on the identification of total effect in Cluster-DAGs with cycles
By: Clément Yvernes
Potential Business Impact:
Finds hidden causes in complex systems.
In this note, we discuss the identifiability of a total effect in cluster-DAGs, allowing for cycles within the cluster-DAG (while still assuming the associated underlying DAG to be acyclic). This is presented into two key results: first, restricting the cluster-DAG to clusters containing at most four nodes; second, adapting the notion of d-separation. We provide a graphical criterion to address the identifiability problem.
Similar Papers
Identifying Macro Causal Effects in a C-DMG over ADMGs
Artificial Intelligence
Finds hidden causes in messy, incomplete information.
Towards Robust Causal Effect Identification Beyond Markov Equivalence
Methodology
Finds causes even when rules are unclear.
Causal Identification in Time Series Models
Machine Learning (CS)
Finds hidden causes in changing data.