This repository provides functionality for working with CPDAGs, which are graphs representing Markov equivalence classes (MEC) of DAGs common in causal discovery. Currently, it focuses mostly on algorithms for counting, sampling and listing the DAGs in the MEC represented by a given CPDAG based on [3].
The algorithms are implemented in Rust and exposed via an Python wrapper available as PyPI package cliquepicking. An R wrapper is planned.
The python package can be installed with:
pip install cliquepicking
For more detailed documentation, see the README in the cliquepicking_python folder.
The goal is to implement further algorithms from my thesis, such as those for MPDAGs. Feature requests are welcome.
The prototypes/ directory contains code I originally wrote in the context of the papers [1] and [2], which is not maintained anymore.
- Marcel Wienöbst, Max Bannach, and Maciej Liśkiewicz: Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs (AAAI 2021) arXiv version
- Marcel Wienöbst, Max Bannach, and Maciej Liśkiewicz: Polynomial-Time Algorithms for Counting and Sampling Markov Equivalent DAGs with Applications (JMLR)
- Marcel Wienöbst: Algorithms for Markov Equivalence (PhD Thesis)