跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.06288 · v2

A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs

首次提交 2026-05-07 21:56
版本更新 2026-11-16 06:58
雷达观测 2026-11-17 17:12
arXiv ↗PDF ↗

摘要

Random directed acyclic graphs (DAGs) based on imposing an order on Erdős-Rényi or scale-free graphs are widely used to generate synthetic data from causal models, in particular for evaluating causal discovery algorithms. We show that the set of nodes reachable via open paths, termed relatives, never decreases along the causal order in all DAGs. We find that it tends to increase strictly for DAGs with certain density parameters, and demonstrate that this pattern can be exploited for causal discovery via sorting by the estimated number of relatives. We note that many simulations in the literature are focused on a narrow range of parameter settings where sorting by relatives yields an excellent proxy for the causal order, and show that a strict increase of relatives leads to a singleton Markov equivalence class. We propose sampling time-series DAGs as a possible alternative and discuss implications for causal discovery and synthetic data generation. Implementations of our algorithms can be found at https://causaldisco.github.io/CausalDisco/.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-16 06:58 · 最新观测版本

A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs

Random directed acyclic graphs (DAGs) based on imposing an order on Erdős-Rényi or scale-free graphs are widely used to generate synthetic data from causal models, in particular for evaluating causal discovery algorithms. We show that the set of nodes reachable via open paths, termed relatives, never decreases along the causal order in all DAGs. We find that it tends to increase strictly for DAGs with certain density parameters, and demonstrate that this pattern can be exploited for causal discovery via sorting by the estimated number of relatives. We note that many simulations in the literature are focused on a narrow range of parameter settings where sorting by relatives yields an excellent proxy for the causal order, and show that a strict increase of relatives leads to a singleton Markov equivalence class. We propose sampling time-series DAGs as a possible alternative and discuss implications for causal discovery and synthetic data generation. Implementations of our algorithms can be found at https://causaldisco.github.io/CausalDisco/.

查看此版本解读 →查看此版本原文 ↗