摘要
针对Markov等价的有向祖先图等价转换问题,研究双向边向单向边等价转换的条件,给出了多条双向边向单向边转换的顺序.结果表明,在保持Markov等价的条件下,任意两个等价的有向祖先图可经过一系列的单向边变双向边、双向边变单向边、单向边反转而相互转换.
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.
出处
《吉林大学学报（理学版）》
CAS
CSCD
北大核心
2015年第5期897-903,共7页
Journal of Jilin University:Science Edition
基金
国家自然科学基金青年基金(批准号:61403290
11301408
11401454)
陕西省青年基金(批准号:2014JQ1020)
宝鸡市科研项目(批准号:2013R7-3)
宝鸡文理学院重点科研项目(批准号:ZK15081)
关键词
祖先图
Markov等价
最小汇连路
覆盖边
ancestral graph
Markov equivalence
minimal collider path
covered edge
