In random causal DAGs generated by imposing order on Erdős-Rényi and scale-free graphs, the number of relatives increases monotonically along the causal order, enabling order recovery via sorting and implying singular Markov equivalence classes under strict monotonicity.
Maathuis, and Nicolai Meinshausen
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ME 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs
In random causal DAGs generated by imposing order on Erdős-Rényi and scale-free graphs, the number of relatives increases monotonically along the causal order, enabling order recovery via sorting and implying singular Markov equivalence classes under strict monotonicity.