arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0908.3605math.STstat.TH
收藏

祖先图的Markov等价性

Markov equivalence for ancestral graphs

R. Ayesha Ali, Thomas S. Richardson, Peter Spirtes

摘要:

祖先图可以编码有向无圈图(DAG)模型中出现的条件独立关系,具有潜在和选择变量。然而,对于任何祖先图,可能有几个其他图是马尔可夫等价的。我们的状态和证明条件下,两个最大的祖先图是马尔可夫相互等价的,从而推广了类似的结果,DAG的其他作者。这些条件导致一个算法,用于确定马尔可夫等价运行的时间是多项式的顶点数的图形。

英文摘要:

Ancestral graphs can encode conditional independence relations that arise in directed acyclic graph (DAG) models with latent and selection variables. However, for any ancestral graph, there may be several other graphs to which it is Markov equivalent. We state and prove conditions under which two maximal ancestral graphs are Markov equivalent to each other, thereby extending analogous results for DAGs given by other authors. These conditions lead to an algorithm for determining Markov equivalence that runs in time that is polynomial in the number of vertices in the graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑