Author:
Fritz Tobias,Liang Wendong
Abstract
AbstractCategorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories are gs-monoidal categories, also known as CD categories. These omit a condition that implements the normalization of probability. Extending work of Corradini and Gadducci, we construct free gs-monoidal and free Markov categories generated by a collection of morphisms of arbitrary arity and coarity. For free gs-monoidal categories, this comes in the form of an explicit combinatorial description of their morphisms as structured cospans of labeled hypergraphs. These can be thought of as a formalization of gs-monoidal string diagrams ($$=$$
=
term graphs) as a combinatorial data structure. We formulate the appropriate 2-categorical universal property based on ideas of Walters and prove that our categories satisfy it. We expect our free categories to be relevant for computer implementations and we also argue that they can be used as statistical causal models generalizing Bayesian networks.
Publisher
Springer Science and Business Media LLC
Subject
General Computer Science,Theoretical Computer Science,Algebra and Number Theory
Reference44 articles.
1. Tobias, F.: A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics. Adv. Math. 370, 107239 (2020)
2. Tobias, F., Eigil, F.R.: The zero-one laws of Kolmogorov and Hewitt-Savage in categorical probability. Compositionality 2, 3 (2020)
3. Tobias, F., Tomáš, G., Paolo, P., and Eigil, F.R.: Representable Markov categories and comparison of statistical experiments in categorical probability (2020). arXiv:2010.07416
4. Tobias, F., Tomáš, G., Paolo, P.: De Finetti’s theorem in categorical probability. J. Stoch. Anal. 2(4), 6 (2021)
5. Bart, J.: Multinomial and hypergeometric distributions in Markov categories. In: Proceedings 37th Conference on. Mathematical Foundations of Programming Semantics, volume 351 of Electroninc Proceedings of Theortic Computing Science, pp 98–115. EPTCS, 2021. arXiv:2112.14044
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. String Diagrams with Factorized Densities;Electronic Proceedings in Theoretical Computer Science;2023-12-14
2. Dilations and information flow axioms in categorical probability;Mathematical Structures in Computer Science;2023-10-25
3. A category-theoretic proof of the ergodic decomposition theorem;Ergodic Theory and Dynamical Systems;2023-02-15
4. Categorical Information Geometry;Lecture Notes in Computer Science;2023