Graph Surgery and the Do-Operator: A Precise Correspondence for Acyclic Structural Causal Models

The paper establishes a precise mathematical link between graph surgery and the do‑operator in deterministic acyclic structural causal models. It shows that deleting arrows in a graph corresponds exactly to replacing the associated mechanisms with constants, proving that “Graph(F^\iota)=Surg(Graph(F),T_\iota)”. The authors further characterize when this equality holds for the full graph, define the intervened model, and demonstrate how sequential interventions combine, concluding that an outcome depends only on interventions at its actual dependency ancestors.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.