Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023
Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons
Vidya Sagar Sharma
The structure of Markov equivalence classes (MECs) of causal DAGs has been studied extensively. A natural question in this regard is to algorithmically find the number of MECs with…
cs.DS2023
A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the same Skeleton
Vidya Sagar Sharma
Causal DAGs (also known as Bayesian networks) are a popular tool for encoding conditional dependencies between random variables. In a causal DAG, the random variables are modeled a…
cs.DS2022
Counting Markov Equivalent Directed Acyclic Graphs Consistent with Background Knowledge
Vidya Sagar Sharma
A polynomial-time exact algorithm for counting the number of directed acyclic graphs in a Markov equivalence class was recently given by Wienöbst, Bannach, and Liśkiewicz (AAAI 202…