2000 character limit reached
Generating Markov Equivalent Maximal Ancestral Graphs by Single Edge Replacement (1207.1428v1)
Published 4 Jul 2012 in stat.ME and cs.AI
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.