Nested Markov properties for acyclic directed mixed graphs
无环有向混合图的嵌套马尔可夫性质
Conditional independence models associated with directed acyclic graphs (DAGs) may be characterized in at least three different ways: via a factorization, the global Markov property (given by the d-separation criterion), and the local Markov property. Marginals of DAG models also imply equality constraints that are not conditional independences; the well-known “Verma constraint” is an example. Constraints of this type are used for testing edges, and in a computationally…