TY - JOUR
AU - Ganian, Robert
AU - Hamm, Thekla
AU - Talvitie, Topi
PY - 2020/04/03
Y2 - 2024/03/01
TI - Title
JF - Proceedings of the AAAI Conference on Artificial Intelligence
JA - AAAI
VL - 34
IS - 06
SE - AAAI Technical Track: Reasoning under Uncertainty
DO - 10.1609/aaai.v34i06.6573
UR - https://ojs.aaai.org/index.php/AAAI/article/view/6573
SP - 10136-10143
AB - <p>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.</p><p>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 class of chordal graphs, including interval graphs.</p>
ER -