The d-separation criterion in Categorical Probability
Not on the map. Why?
Abstract (arXiv)
The d-separation criterion detects the compatibility of a joint probability distribution with a directed acyclic graph through certain conditional independences. In this work, we study this problem in the context of categorical probability theory by introducing a categorical definition of causal models, a categorical notion of d-separation, and proving an abstract version of the d-separation criterion. This approach has two main benefits. First, categorical d-separation is a very intuitive criterion based on topological connectedness. Second, our results apply both to measure-theoretic probability (with standard Borel spaces) and beyond probability theory, including to deterministic and possibilistic networks. It therefore provides a clean proof of the equivalence of local and global Markov properties with causal compatibility for continuous and mixed random variables as well as deterministic and possibilistic variables.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 11 of its 39 references that are in the map. First posted on arXiv 12 Jul 2022.
Builds on
11 of 39 references.
References · 11
- 2013Causal Networks: Semantics and Expressivenesscited by 67
- 2019A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statisticscited by 55
- 2017Disintegration and Bayesian Inversion via String Diagramscited by 32
- 2017Markov Properties for Graphical Models with Cycles and Latent Variablescited by 32
- 2021Compositional Abstraction Error and a Category of Causal Modelscited by 32
- 2013On the Testability of Causal Models with Latent and Instrumental Variablescited by 26
- 2018Causal Inference by String Diagram Surgerycited by 23
- 2013Instrumentality Tests Revisitedcited by 8
- 2022Free gs-monoidal categories and free Markov categoriescited by 6
- 2016Rewriting modulo symmetric monoidal structurecited by 4
- 2021Transitional Conditional Independencecited by 3
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 7; 2026: 2.
12 papers.
- 2023Causal models in string diagramscited by 14
- 2025Intuitionistic j-Do-Calculus in Topos Causal Modelscited by 4
- 2023Active Inference in String Diagrams: A Categorical Account of Predictive Processing and Free Energycited by 3
- 2025A "good regulator theorem" for embodied agentscited by 3
- 2026Infinitesimal Causalitycited by 2
- 2025A Rose by Any Other Name Would Smell as Sweet: Categorical Homotopy Theory for Large Language Modelscited by 1
- 2023String Diagrams with Factorized Densitiescited by 0
- 2025Topos Causal Modelscited by 0
- 2025Consciousness as a Functorcited by 0
- 2025Causal Abstractions, Categorically Unifiedcited by 0
- 2025Bayesian Networks, Markov Networks, Moralisation, Triangulation: a Categorical Perspectivecited by 0
- 2026Notes on Forr'e's Notion of Conditional Independence and Causal Calculus for Continuous Variablescited by 0
- 2026Infinitesimal Causality23 Jun 2026
- 2026Notes on Forr'e's Notion of Conditional Independence and Causal Calculus for Continuous Variables25 Mar 2026
- 2025Bayesian Networks, Markov Networks, Moralisation, Triangulation: a Categorical Perspective10 Dec 2025
- 2025Intuitionistic j-Do-Calculus in Topos Causal Models20 Oct 2025
- 2025Causal Abstractions, Categorically Unified6 Oct 2025
- 2025Consciousness as a Functor25 Aug 2025
- 2025A Rose by Any Other Name Would Smell as Sweet: Categorical Homotopy Theory for Large Language Models7 Aug 2025
- 2025Topos Causal Models5 Aug 2025
- 2025A "good regulator theorem" for embodied agents4 Aug 2025
- 2023Active Inference in String Diagrams: A Categorical Account of Predictive Processing and Free Energy1 Aug 2023
- 2023String Diagrams with Factorized Densities4 May 2023
- 2023Causal models in string diagrams15 Apr 2023