Reproduce “Clustering and Structural Robustness in Causal Diagrams” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Santtu Tikka, Jouni Helske, Juha Karvanen

The authors develop algorithms to find transit clusters in causal diagrams: groups whose shared external causes and effects allow their internal paths to be compressed. They prove that, for queries outside a cluster, identifiability is preserved when the cluster is plain or congested. In a Sangiovese example, 13 variables collapse to one representative; other transit clusters can lose identifiability.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.