
A Topological Sorting Criterion for Random Causal Directed Acyclic Graphs
In randomly ordered DAGs, relative counts increase monotonically along causal order, enabling recovery via sorting and yielding singular equivalence classes.
Paris Poster Session 5, Fri, Dec 11, 11:30 AM–1:30 PM, Paris Poster Hall · Published 2026
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.