Research map / Probabilistic and scientific modeling / Causal discovery
Counting and Sampling from Markov Equivalent DAGs Using Clique Trees
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.2, p=20 | runtime (seconds): 0.27 -> 0.50 | Hurt |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.2, p=30 | runtime (seconds): 2.61 -> 2.26 | Helped |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.2, p=40 | runtime (seconds): 20.68 -> 6.65 | Helped |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.2, p=50 | runtime (seconds): 219.98 -> 19.55 | Helped |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.2, p=60 | runtime (seconds): >3600 -> 55.59 | Helped |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.25, p=20 | runtime (seconds): 0.40 -> 0.51 | Hurt |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.25, p=30 | runtime (seconds): 8.77 -> 2.27 | Helped |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.25, p=40 | runtime (seconds): 101.84 -> 7.56 | Helped |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.25, p=50 | runtime (seconds): 1760.21 -> 25.46 | Helped |
| Use clique-tree counting instead of the prior counting algorithm | MEC size calculation · Random UCCGs, r=0.25, p=60 | runtime (seconds): >3600 -> 59.21 | Helped |
Closest papers by meaning
- A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton (AAAI 2024 · similarity 0.93)
- An Improved Clique-Picking Algorithm for Counting Markov Equivalent DAGs via Super Cliques Transfer (ICML 2025 · similarity 0.91)
- Interventional Causal Discovery in a Mixture of DAGs (NeurIPS 2024 · similarity 0.91)
- Coarsening Linear Non-Gaussian Causal Models with Cycles (NeurIPS 2026 · similarity 0.91)
- Sample Efficient Bayesian Learning of Causal Graphs from Interventions (NeurIPS 2024 · similarity 0.90)
- Relaxing partition admissibility in Cluster-DAGs: a causal calculus with arbitrary variable clustering (NeurIPS 2025 · similarity 0.89)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.