arXiv:2605.06288v2 stat.ME

A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs

Alexander G. Reisach, Antoine Chambaz, Gilles Blanchard, Sebastian Weichwald

제출 2026-11-17

원문 초록

Random directed acyclic graphs (DAGs) based on imposing an order on Erd\H{o}s-R\'enyi 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/.

제출 이력

확인된 버전만 표시합니다. 전체 제출 이력은 arXiv 원문에서 확인하세요.

  1. arXiv:2605.06288v2제출 시각 미확인

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

공통 태그로 연결된 공개 논문이 아직 없습니다.

토론

이 논문과 연결된 포럼 글이 아직 없습니다.