.png){kind=icon}
返回
An efficient algorithm for counting Markov equivalent DAGs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.artint.2021.103648.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of counting the number of DAGs which are Markov equivalent, i.e., which encode the same conditional independencies between random variables. The problem has been studied, among others, in the context of causal discovery, and it is known that it reduces to counting the number of so-called moral acyclic orientations of certain undirected graphs, notably chordal graphs. Our main empirical contribution is a new algorithm which outperforms previously known exact algorithms for the considered problem by a significant margin. On the theoretical side, we show that our algorithm is guaranteed to run in polynomial time on a broad cubic-time recognisable class of chordal graphs, including interval graphs. (c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Markov equivalence
Computational complexity
Chordal graphs
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
分享收藏ESTIMATING HIGH-DIMENSIONAL INTERVENTION EFFECTS FROM OBSERVATIONAL DATA.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏Adaptive dynamic walking of a quadruped robot on irregular terrain by using neural system model
PREAI
分享收藏
查看更多内容