A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs

ArXi:2605.06288v1 Announce Type: cross 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, termed relatives, increases monotonically along the causal order. We assess the prevalence of this pattern numerically, and nstrate that it can be exploited for causal order recovery via sorting by the estimated number of relatives.