Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications

Marcel Wienöbst, Max Bannach, Maciej Liśkiewicz

Counting and sampling directed acyclic graphs from a Markov equivalence class are fundamental tasks in graphical causal analysis. In this paper we show that these tasks can be perf…