Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement
Methodology
2012-07-09 v1 Artificial Intelligence
Abstract
Maximal ancestral graphs (MAGs) are used to encode conditional independence relations in DAG models with hidden variables. Different MAGs may represent the same set of conditional independences and are called Markov equivalent. This paper considers MAGs without undirected edges and shows conditions under which an arrow in a MAG can be reversed or interchanged with a bi-directed edge so as to yield a Markov equivalent MAG.
Keywords
Cite
@article{arxiv.1207.1428,
title = {Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement},
author = {Jin Tian},
journal= {arXiv preprint arXiv:1207.1428},
year = {2012}
}
Comments
Appears in Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI2005)