A transformational characterization of Markov equivalence for directed acyclic graphs with latent variables
Proceedings of the Twenty-First Conference Conference on Uncertainty in Artificial Intelligence (2005)
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.
Copyright © UAI 2005, AUAI Press.
Access to external full text or publisher's version may require subscription.
ISBN of the source publication: 0974903914
Zhang, J. & Spirtes, P. (2005). A transformational characterization of Markov equivalence for directed acyclic graphs with latent variables. In F. Bacchus & T. Jaakkola (Eds.), Proceedings of the Twenty-First Conference Conference on Uncertainty in Artificial Intelligence (2005) (pp.667-674). Arlington, Virginia: AUAI Press. Retrieved from https://dslpitt.org/uai/papers/05/p667-zhang.pdf