A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs
概要
arXiv:2605.06288v1 Announce Type: cross Abstract: Random directed acyclic graphs (DAGs) based on imposing an order on Erd\H{o}s-R\'enyi and scale free random graphs are widely used for evaluating causal discovery algorithms. We show that in such DAGs, the set of nodes reachable via open paths, term…
