Graded String Diagrams with Applications in Probabilistic Reasoning
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.
- quotes — Graded String Diagrams with Applications in Probabilistic Reasoning (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2501.18404; status: unverified)
- quotes — summary: 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. (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2501.18404; status: unverified)
- quotes — url: https://arxiv.org/abs/2501.18404 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2501.18404; status: unverified)
- quotes — source-subject: arxiv:2501.18404 (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2501.18404; status: unverified)
- quotes — source-edition: sha256:4b767f1aea0a9d351c379c01f7b0a3d094ec8a5f5334d81379c481f7cab21dfc (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2501.18404; status: unverified)
- quotes — source-metadata: {"subject":"arxiv:2501.18404","id":"2501.18404","url":"https://arxiv.org/abs/2501.18404","datestamp":"2026-11-10","status":"present","title":"Graded String Diagrams with Applications in Probabilistic Reasoning","abstract":"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.","authors":["Ralph Sarkis","Fabio Zanasi"],"categories":["math.CT","cs.LO"],"created":"2026-11-09","updated":"2026-11-10","articleLicense":"http://creativecommons.org/licenses/by/4.0/","version":null,"editionDigest":"sha256:4b767f1aea0a9d351c379c01f7b0a3d094ec8a5f5334d81379c481f7cab21dfc","sourceResponseAt":"2026-11-18T21:09:11Z","sourceDigest":"sha256:9463ef807009af84c66928c04f1b177905cda41c60c5b55e502ef901a90fca83"} (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2501.18404; status: unverified)
- quotes — editorial-standing: source metadata; editorial acceptance pending (witness: https://oaipmh.arxiv.org/oai; method: quoted collector metadata from an original HTTP response; citation: https://arxiv.org/abs/2501.18404; status: unverified)