吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

有向最大祖先图的Markov等价转换

李艳颖1,2, 杨有龙1, 杨文明1   

  1. 1. 西安电子科技大学 数学与统计学院, 西安 710071; 2. 宝鸡文理学院 数学与信息科学学院, 陕西 宝鸡 721013
  • 收稿日期:2014-12-08 出版日期:2015-09-26 发布日期:2015-09-29
  • 通讯作者: 杨有龙 E-mail:yylyang@mail.xidian.edu

Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs

LI Yanying1,2, YANG Youlong1, YANG Wenming1   

  1. 1. School of Mathematics and Statistics, Xidian University, Xi’an 710071, China; 2. School of Mathematicsand Information Science, Baoji University of Arts and Science, Baoji 721013, Shaanxi Province, China
  • Received:2014-12-08 Online:2015-09-26 Published:2015-09-29
  • Contact: YANG Youlong E-mail:yylyang@mail.xidian.edu

摘要:

针对Markov等价的有向祖先图等价转换问题, 研究双向边向单向边等价转换的条件, 给出了多条双向边向单向边转换的顺序. 结果表明, 在保持Markov等价的条件下, 任意两个等价的有向祖先图可经过一系列的单向边变双向边、 双向边变单向边、 单向边反转而相互转换.

关键词: 祖先图, Markov等价, 最小汇连路, 覆盖边

Abstract:

To describe the transformational characterization of Markov equivalence for directed maximal ancestral graphs, the authors proposed a sequence of transformation of bidirected edges to directed edges which preserve Markov equivalence. Therefore, any two equivalent directed maximal ancestral graphs can equivalently transform to each other via changing bidirected edges to directed edges, changing directed edges to bidirected edges and reversing directed edges.

Key words: ancestral graph, Markov equivalence, minimal collider path, covered edge

中图分类号: 

  • O157.5