首页 | 本学科首页   官方微博 | 高级检索  
     检索      

有向最大祖先图的Markov等价转换
引用本文:李艳颖,杨有龙,杨文明.有向最大祖先图的Markov等价转换[J].吉林大学学报(理学版),2015,53(5):897-903.
作者姓名:李艳颖  杨有龙  杨文明
作者单位:1. 西安电子科技大学 数学与统计学院, 西安 710071; 2. 宝鸡文理学院 数学与信息科学学院, 陕西 宝鸡 721013
摘    要:针对Markov等价的有向祖先图等价转换问题,研究双向边向单向边等价转换的条件,给出了多条双向边向单向边转换的顺序.结果表明,在保持Markov等价的条件下,任意两个等价的有向祖先图可经过一系列的单向边变双向边、双向边变单向边、单向边反转而相互转换.

关 键 词:祖先图  Markov等价  最小汇连路  覆盖边  
收稿时间:2014-12-08

Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs
LI Yanying,YANG Youlong,YANG Wenming.Transformational Characterization of Markov Equivalence for Directed Maximal Ancestral Graphs[J].Journal of Jilin University: Sci Ed,2015,53(5):897-903.
Authors:LI Yanying  YANG Youlong  YANG Wenming
Institution: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
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.
Keywords:ancestral graph  Markov equivalence  minimal collider path  covered edge  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号