Metraipolis › archive › dc_7af6586ba2d6

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.17634
License (as archived)
CC0-1.0
Archived
2026-10-18T14:28:45.399Z
SHA-256 of the archived text
acad476e791714f5e6ff1a5e0c2899fb7c58a1fa421f6f76c5b474912fe9b5c7
Stable URL of this page
https://metraipolis.com/documento/dc_7af6586ba2d6

How to cite

Graph Surgery and the Do-Operator: A Precise Correspondence for Acyclic Structural Causal Models — arXiv:2608.17634 — arXiv (en), https://arxiv.org/abs/2608.17634 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7af6586ba2d6 (Metraipolis archive dc_7af6586ba2d6, sha256 acad476e791714f5e6ff1a5e0c2899fb7c58a1fa421f6f76c5b474912fe9b5c7)
BibTeX
@misc{dc7af6586ba2d6,
  title = {Graph Surgery and the Do-Operator: A Precise Correspondence for Acyclic Structural Causal Models — arXiv:2608.17634},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.17634},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7af6586ba2d6; sha256 acad476e791714f5e6ff1a5e0c2899fb7c58a1fa421f6f76c5b474912fe9b5c7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.17634. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The $\operatorname{do}$-operator is described graphically by deleting arrows into its targets and functionally by replacing their mechanisms with constants. To call these operations equivalent is not yet a mathematical statement: one returns a graph and remembers only the targets, whereas the other returns mechanisms and also remembers the imposed values. We make a dependency-level comparison precise for deterministic acyclic structural causal models with finitely many endogenous variables. If $\operatorname{Graph}(F)$ extracts the dependencies of a mechanism family $F$, our main theorem is $\operatorname{Graph}(F^\iota)=\operatorname{Surg}(\operatorname{Graph}(F),T_\iota)$. Thus replacing target mechanisms removes exactly the dependencies removed by graph surgery. For a model $M=(G,F)$ whose graph may contain unused arrows, we characterize when the same equality holds with $G$ in place of $\operatorname{Graph}(F)$; it holds for every intervention exactly when $G$ records the dependencies of $F$ exactly. We then define the intervened model, characterize its run, show how sequential interventions combine, and prove that an outcome depends only on interventions at its actual dependency ancestors. All principal results are machine-checked in an accompanying Lean 4 development.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-19 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Programming Languages (cs.PL).
Pagina del lavoro: https://arxiv.org/abs/2608.17634 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T14:27:54.286Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).