The d-separation criterion in Categorical Probability
From MaRDI portal
Publication:6404763
arXiv2207.05740MaRDI QIDQ6404763FDOQ6404763
Tobias Fritz, Andreas Klingler
Publication date: 12 July 2022
Abstract: 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.
Graphical methods in statistics (62A09) Causal inference from observational studies (62D20) Axioms; other general questions in probability (60A05) String diagrams and graphical calculi (18M30) Categories of networks and processes, compositionality (18M35)
This page was built for publication: The d-separation criterion in Categorical Probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6404763)
