Separation and Completeness Properties for Amp Chain Graph Markov Models
AMP 链图马尔可夫模型的分离与完备性
Pearl ’s well-known $d$-separation criterion for an acyclic directed graph (ADG) is a pathwise separation criterion that can be used to efficiently identify all valid conditional independence relations in the Markov model determined by the graph. This paper introduces $p$-separation, a pathwise separation criterion that efficiently identifies all valid conditional independences under the Andersson–Madigan–Perlman (AMP) alternative Markov property for chain graphs ( =…