A Logical Characterization of Constraint-Based Causal Discovery

Proof. As the edges in GC represent causal relations, a path of length 0 (no edge) is not considered a causal relation, and existence of a directed path from a variable back to itself would contravene the causal DAG assumption, hence: irreflexive and acyclic (or, more accurate, asymmetric). Transitivity follows immediately, by concatenation, from the sequence 〈X, .., Y, .., Z〉, in which each node is parent of its successor, hence a directed path from X to Z in GC .

Paper

Similar papers

© 2026 NYSGPT2525 LLC