Characterizing Markov equivalence classes for AMP chain graph models
AMP 链图模型的马尔可夫等价类刻画
Chain graphs (CG) (= adicyclic graphs) use undirected and directed edges to represent both structural and associative dependences. Like acyclic directed graphs (ADGs), the CG associated with a statistical Markov model may not be unique, so CGs fall into Markov equivalence classes, which may be superexponentially large, leading to unidentifiability and computational inefficiency in model search and selection. It is shown here that, under the Andersson–Madigan–Perlman (AMP)…