A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics

From MaRDI portal
Publication:2189508




Abstract: We develop Markov categories as a framework for synthetic probability and statistics, following work of Golubtsov as well as Cho and Jacobs. This means that we treat the following concepts in purely abstract categorical terms: conditioning and disintegration; various versions of conditional independence and its standard properties; conditional products; almost surely; sufficient statistics; versions of theorems on sufficient statistics due to Fisher--Neyman, Basu, and Bahadur. Besides the conceptual clarity offered by our categorical setup, its main advantage is that it provides a uniform treatment of various types of probability theory, including discrete probability theory, measure-theoretic probability with general measurable spaces, Gaussian probability, stochastic processes of either of these kinds, and many others.



Cites work


Cited in
(46)


Describes a project that uses

Uses Software





This page was built for publication: A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189508)