Arrowhead completeness from minimal conditional independencies
Tom Claassen, Tom Heskes · Radboud Repository (Radboud University) · 2010
We present two inference rules, based on so called minimal conditional indepen dencies, that are sufficient to find all invariant arrowheads in a single causal DAG, even when selection bias may be present.It turns out that the set of seven graphi cal orientation rules that are usually employed to identify these arrowheads are, in fact, just different instances/manifestations of these two rules.Contains detailed proofs to main results.