arXiv:2501.18404 · v5

Graded String Diagrams with Applications in Probabilistic Reasoning

首次提交 2025-01-30 23:00

版本更新 2026-11-10 01:12

雷达观测 2026-11-10 15:22

摘要

We introduce string diagrams for graded symmetric monoidal categories. Our approach includes a definition of graded monoidal theory and the corresponding freely generated syntactic category. The para construction on monoidal actegories is a motivating example for our framework, and we show how an axiomatic presentation of the resulting category $\mathbf{Para}(\mathbb{G},\mathbf{C})$ may be modularly obtained from presentations for $\mathbb{G}$ and $\mathbf{C}$. We demonstrate three different applications of our diagrammatic language under the same theme: probabilistic reasoning. First, we show how to axiomatise a variant of the graded category $\mathbf{ImP}$, recently introduced by Liell-Cock and Staton to model imprecise probability. This culminates in a representation, as string diagrams with grading wires, of programs with primitives for nondeterministic and probabilistic choices and conditioning. Second, we exploit our modular presentation result to provide a new proof for a presentation of $\mathbf{Gauss}$, the category of Gaussian stochastic maps. Third, we use grading wires to represent causal interventions on Bayesian networks.

作者备注：New Section 3.3 on quotient up to regrading. New Section 7 on presentation of Gaussian maps. Old Section 7 is now Section 8 with added Section 8.5 on identifiability. Implemented many suggestions from reviewers