Different directed acyclic graphs (DAGs) may be Markov equivalent in the sense that they entail the same conditional independence relations among the observed variables. Chickering (1995) provided a transformational characterization of Markov equivalence for DAGs (with no latent variables), which is useful in deriving properties shared by Markov equivalent DAGs, and, with certain generalization, is needed to prove the asymptotic correctness of a search procedure over Markov equivalence classes, known as the GES algorithm. For DAG models with latent variables, maximal ancestral graphs (MAGs) provide a neat representation that facilitates model search. However, no transformational characterization -- analogous to Chickering's -- of Markov equivalent MAGs is yet available. This paper establishes such a characterization for directed MAGs, which we expect will have similar uses as it does for DAGs.
|Title of host publication||Proceedings of the Twenty-First Conference Conference on Uncertainty in Artificial Intelligence (2005)|
|Number of pages||8|
|Publication status||Published - 1 Jan 2005|
ZHANG, J., & SPIRTES, P. (2005). A transformational characterization of Markov equivalence for directed acyclic graphs with latent variables. In Proceedings of the Twenty-First Conference Conference on Uncertainty in Artificial Intelligence (2005) (pp. 667-674). AUAI Press.