Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs

12/17/2020
by   Marcel Wienöbst, et al.
0

Counting and uniform sampling of directed acyclic graphs (DAGs) from a Markov equivalence class are fundamental tasks in graphical causal analysis. In this paper, we show that these tasks can be performed in polynomial time, solving a long-standing open problem in this area. Our algorithms are effective and easily implementable. Experimental results show that the algorithms significantly outperform state-of-the-art methods.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset