nLab Giry monad

Contents

Contents

Idea

The Giry monad (Giry 80, following Lawvere 62) is the monad on a category of suitable spaces which sends each suitable space XX to the space of suitable probability measures on XX.

It is one of the main examples of a probability monad, and hence one of the main structures used in categorical probability.

Definition

The Giry monad is defined on the category of measurable spaces, assigning to each measurable space XX the space G(X)G(X) of all probability measures on XX endowed with the σ \sigma -algebra generated by the set of all the evaluation maps

ev U:G(X)[0,1] ev_U \colon G(X) \to [0,1]

sending a probability measure PP to P(U)P(U), where UU ranges over all the measurable sets of XX. The unit of the monad sends a point xXx \in X to the Dirac measure at xx, δ x\delta_x, while the monad-multiplication is defined by the natural transformation

μ X:G(G(X))G(X) \mu_{X} \;\colon\; G\big(G(X)\big) \longrightarrow G(X)

given by

μ X(Q)(U) qG(X)ev U(q)dQ. \mu_X (Q)(U) \;\coloneqq\; \textstyle{\int}_{q \in G(X)} ev_U(q) \,dQ \,.

This makes the endofunctor GG into a monad, and as such this is the Giry monad on measurable spaces, as originally defined by Lawvere 1962.

An alternative choice, convenient for analysis purposes, and introduced by Giry, is obtained by restricting the category of measurable spaces to the (full) subcategory which are those measurable spaces generated by Polish spaces, PolPol, which are separable metric spaces for which a complete metric exists. The morphisms of this category are continuous functions.

Write

P:PolPol P \colon Pol \to Pol

for the endofunctor which sends a space, XX, to the space of probability measures on the Borel subsets of XX. P(X)P(X) is equipped with the weakest topology which makes the integration map τ Xfdτ\tau \mapsto \int_{X}f d\tau continuous for any ff, a bounded, continuous, real function on XX.

There is a natural transformation

μ X:P(P(X))P(X) \mu_{X}: P(P(X)) \to P(X)

given by

μ X(M)(A):= P(X)τ(A)M(dτ). \mu_X (M)(A) := \int_{P(X)} \tau(A) M(d\tau).

This makes the endofunctor PP into a monad, and this is the Giry monad on Polish spaces.

Properties

Kleisli category

The Kleisli morphisms of the Giry monad on Meas (and related subcategories) are Markov kernels. Therefore its Kleisli category is the category Stoch. It is one of the most important examples of a Markov category.

Algebras over the Giry monad

We can’t say anything about the GG-algebras on the category of measurable spaces due to lack of structure and set-theoretical issues. However, we can analyze the PP-algebras exploiting the continuous morphisms and countably dense subsets on the spaces PXP{X}, and give a class of non-free PP-algebras.

If XX is any measurable space then the space of probability measures PXP{X} is a convex space with the structure defined pointwise, i.e., if {P i} i=1 n\{P_i\}_{i=1}^{n} is a finite collection of probability measures on XX then, for every sequence {p i} i=1 n\{p_i\}_{i=1}^{n} with each p i[0,1]p_i \in [0,1] the affine sum i=1 np iP i\sum_{i=1}^{n} p_i P_i, is also a probability measure, defined at the measurable set UU in XX by

( i=1 np iP i)(U)= i=1 np iP i(U). \big(\sum_{i=1}^{n} p_i P_i\big)(U) = \sum_{i=1}^{n} p_i P_i(U).

On the otherhand, given any PP-algebra h:PXXh: P{X} \rightarrow X it follows that XX can also be endowed with a convex structure by defining, for every affine sum of nn elements of XX,

i=1 np ix i:=h( i=1 np iδ x i). \sum_{i=1}^n p_i x_i := h(\sum_{i=1}^n p_i \delta_{x_i}).

To analyze PP-algebras, via the Eilenberg-Moore representation as morphisms h:PXXh:P{X} \rightarrow X, we require

Lemma

Given any PP-algebra h:PXXh: P{X} \rightarrow X the continuous function hh is an affine map.
Moreover, for any measurable space YY and PP-algebra k:PYYk:P{Y} \rightarrow Y on it, if f:(X,h)(Y,k)f: (X, h) \rightarrow (Y, k) is a map of PP-algebras then the continuous function ff is also affine.

Proof

Because a PP-algebra hh must satisfy hμ X=hPhh \circ \mu_X = h \circ P{h} we have

(hμ X)( i=1 np iδ Q i) = (hPh)( i=1 np iδ Q i) h( i=1 np iQ i) = h( i=1 np iδ h(Q i)) = i=1 np ih(Q i) \begin{array}{lcl} (h \circ \mu_X)( \sum_{i=1}^n p_i \delta_{Q_i}) &=& (h \circ P{h})( \sum_{i=1}^n p_i \delta_{Q_i}) \\ h( \sum_{i=1}^n p_i Q_i) &=& h(\sum_{i=1}^n p_i \, \delta_{h(Q_i)}) \\ &=& \sum_{i=1}^n p_i h(Q_i) \end{array}

where the last line makes use of the definition of the convex structure on XX. Thus every PP-algebra is affine.

To prove the map of PP-algebras is an affine map we compute

f( i=1 np ix i) = f(h( i=1 np iδ x i)) = k(P(f)( i=1 np iδ x i) = k( i=1 np iδ f(x i)) = i=1 np if(x i) . \begin{array}{lcll} f(\sum_{i=1}^n p_i x_i) &=& f(h(\sum_{i=1}^n p_i \delta_{x_i})) & \\ &=& k(P(f)(\sum_{i=1}^n p_i \delta_{x_i}) & \\ &=& k(\sum_{i=1}^n p_i \delta_{f(x_i)}) & \\ &=& \sum_{i=1}^n p_i f(x_i) & \end{array}.

Remark: The space PXP{X} actually has a superconvex structure since, for lim n i=1 np i=1\lim_{n \rightarrow \infty} \sum_{i=1}^n p_i=1 and each p i[0,1]p_i \in [0,1], the countable affine sum i=1 p iP i\sum_{i=1}^{\infty} p_i P_i also defines a probability measure on PXP{X}. The preceding Lemma also then holds for the term “affine” replaced by “countably affine”.

Lemma

(Uniqueness of PP-algebras) Let XX be a Polish space and suppose f,g:PXXf,g:P{X} \rightarrow X are a pair of PP-algebras. Then f=gf=g.

Proof


The space XX, being a separable metric space, has a countable dense subset EE, and hence the set D={ i=1 nr iδ e i|e iE,r i[0,1], i=1 nr i=1, and n finite}D=\{\sum_{i=1}^n r_i \delta_{e_i} \, | \, e_i\in \E, r_i \in \mathbb{Q}\cap[0,1], \sum_{i=1}^n r_i=1, \text{ and } n \text{ finite}\} is dense in PXP{X}.(Parthasarathy, Probability measures on metric spaces,Theorem 6.3) Since the set DD is dense in PXP{X} and PXP{X} is a complete separable metric space it follows that the functions ff and gg are completely determined by their values on the dense subset DD. We have f( i=1 nr iδ e i)= i=1 nr if(δ e i)= i=1 nr ie if(\sum_{i=1}^n r_i \delta_{e_i})= \sum_{i=1}^n r_i f(\delta_{e_i}) = \sum_{i=1}^n r_i e_i, where the first equality follows by Lemma , and the second equality by the required condition on algebras, h(δ e)=eh(\delta_e)=e, and similiarly g( i=1 nr iδ e i)= i=1 nr ie i.g(\sum_{i=1}^n r_i \delta_{e_i}) = \sum_{i=1}^n r_i e_i. Since f=gf=g on the dense subset and both ff and gg are continuous maps it follows that f=gf=g on all of PXP{X}.

Lemma

Let XX be a Polish space and suppose h:PXXh:P{X} \rightarrow X is a PP-algebra. Then hh is a free PP-algebra if and only if there exists a Cvx\mathbf{Cvx}-isomorphism ϕ:XPY\phi: X \rightarrow P{Y} for some Polish space YY.

Proof

Suppose there exists a Cvx\mathbf{Cvx}-isomorphism ϕ:XPY\phi: X \rightarrow P{Y} then h^=ϕhP(ϕ 1):P(PY)PY\hat{h} = \phi \circ h \circ P(\phi^{-1}): P(P{Y}) \rightarrow P{Y} is also a PP-algebra. Since the multiplication natural transformation μ:PPP\mu: P \circ P \Rightarrow P gives the free PP-algebra μ Y:P(PY)PY\mu_Y: P(P{Y}) \rightarrow P{Y} it follows by the uniqueness lemma that h^=μ Y\hat{h}=\mu_Y. Because ϕ\phi is a Cvx\mathbf{Cvx}-isomorphism it then follows that hh is a free PP-algebra.

Conversely, if hh is a free PP-algebra then, since all free PP-algebras are given by μ Y:P(PY)PY\mu_Y: P(P{Y}) \rightarrow P{Y} for every space YY, there must exists a particular space YY such that X=PYX = P{Y}. Hence the identity map yields a Cvx\mathbf{Cvx}-isomorphism id:XPYid: X \rightarrow P{Y}.

Lemma

The space P2×P2P{\mathbf{2}} \times P{\mathbf{2}} is not Cvx\mathbf{Cvx}-isomorphic to PXP{X} for any Polish space XX.

Proof

Every element of P2×P2P{\mathbf{2}} \times P{\mathbf{2}} is characterized precisely by two independent real numbers r,s[0,1]r,s \in [0,1]. The only space XX for which every element QPXQ \in P{X} is characterized by two parameters is P3P{\mathbf{3}}. However those two parameters are not independent since choosing the first parameter as one forces the second parameter to be zero. An equivalent way to state this is to say that the coequalizer of the pair of points (0,1)(0,1) and (1,1)(1,1) of the space [0,1]×[0,1][0,1] \times [0,1] is, up to isomorphism, P(3)P(\mathbf{3}). The congruence relation RR is the relationship on [0,1]×[0,1][0,1]\times [0,1] with the equivalence classes specified by

[(x,y)] R={{(x,y)}when x+y<1 {(u,y)[0,1]×[0,1]|u+y1}, [(x,y)]_R = \left\{ \begin{array}{l} \{(x,y)\} \quad \text{when } x+y \lt 1 \\ \{(u,y) \in [0,1]\times [0,1] \, | \, u+y \ge 1\} \end{array} \right.,

is Cvx\mathbf{Cvx}-isomorphic to P(3)P(\mathbf{3}). (Draw the picture.)

Lemma

(Marginalization PP-algebra) Let π i:P(2)×P(2)P(2)\pi_i: P(\mathbf{2})\times P(\mathbf{2}) \rightarrow P(\mathbf{2}), for i=1,2i=1,2 denote the two coordinate projection maps of the product space P(2)×P(2)P(\mathbf{2}) \times P(\mathbf{2}). The function m:P(P2×P2)P2×P2m:P( P{\mathbf{2}} \times P{\mathbf{2}}) \rightarrow P{\mathbf{2}} \times P{\mathbf{2}} specified by marginalization, Q((μ 2Pπ 1)Q,(μ 2Pπ 2)Q)Q \mapsto \big( (\mu_2\circ P{\pi_1})Q, (\mu_2 \circ P{\pi_2})Q\big), is a PP-algebra.

Proof

The function mm is continuous because each of the component maps are continuous. The condition mη P2×P2=id P2×P2m \circ \eta_{P{\mathbf{2}} \times P{\mathbf{2}}} = id_{P{\mathbf{2}} \times P{\mathbf{2}}} follows because for each element (Q,R)P2×P2(Q,R) \in P{\mathbf{2}} \times P{\mathbf{2}} we have μ 2(Gπ 1δ (Q,R))=μ 2(δ π 1(Q,R))=μ 2(δ P)=Q\mu_2(G{\pi_1} \delta_{(Q,R)}) = \mu_2(\delta_{\pi_1(Q,R)}) = \mu_2(\delta_P)=Q and similarly μ 2(Pπ 2δ (Q,R))=R\mu_2(P{\pi_2} \delta_{(Q,R)}) =R.

To prove the required condition Pmm=μ P2×P2mP{m} \circ m= \mu_{P{2} \times P{2}} \circ m first note that mm is an affine function because each component map μ 2Pπ i\mu_2 \circ P{\pi_i}, for i=1,2i=1,2, is a composite of affine maps. Moreover, since P2×P2P{\mathbf{2}} \times P{\mathbf{2}} is a separable metric space it has a countable dense subset of elements (u k,v k)(u_k, v_k) so that the set of elements consisting of affine sums of Dirac measures of the form j=1 ps jδ (u j,v j)\sum_{j=1}^p s_j \delta_{(u_j,v_j)} for pp a finite number is a dense subset of P(P2×P2)P(P{\mathbf{2}} \times P{\mathbf{2}}). In turn it follows that affine sums of elements of the form i=1 nr iδ j=1 ps j iδ (u j i,v j i)\sum_{i=1}^n r_i \delta_{\sum_{j=1}^p s_j^i \delta_{(u_j^i,v_j^i)}} specify a dense subset of P(P(P(2)×P(2)))P(P(P(\mathbf{2}) \times P(\mathbf{2}))). A direct computation on the dense elements, using the fact that all the maps are affine, then yields Pmm=μ P2×P2mP{m} \circ m= \mu_{P{\mathbf{2}} \times P{\mathbf{2}}} \circ m on all the elements of the dense set. Since the maps are all continuous it therefore follows that Pmm=μ P2×P2mP{m} \circ m= \mu_{P{\mathbf{2}} \times P{\mathbf{2}}} \circ m on all elements of P(P(P2×P2))P(P(P{\mathbf{2}} \times P{\mathbf{2}})). This completes the proof that mm is a PP-algebra.

Theorem

The category of PP-algebras is not equivalent to the Kleisi category of the PP-monad for Polish spaces. In other words, there are non-free PP-algebras.

Proof

By Lemma we know that the marginalization map m:P(P2×P2)P2×P2m:P( P{\mathbf{2}} \times P{\mathbf{2}}) \rightarrow P{\mathbf{2}} \times P{\mathbf{2}} is a PP-algebra. By Lemma we know that P2×P2P{\mathbf{2}} \times P{\mathbf{2}} is not Cvx\mathbf{Cvx}-isomorphic to PYP{Y} for any space YY. Hence by Lemma it follows that mm is not a free PP-algebra, and hence the category of PP-algebras is not equivalent to the Kleisi category for the PP-monad.

If Lemma can be generalized to the statement that if the convex space iIP(X i)\prod_{i \in I}P(X_i), where II is a countable indexing set, is not Cvx\mathbf{Cvx}-isomorphic to P(Z)P(Z) for any Polish space ZZ then all the marginalization maps m:P( iIP(X i)) iIP(X i)m: P\big(\prod_{i \in I}P(X_i)\big) \rightarrow \prod_{i \in I}P(X_i) are non-free PP-algebras. Those maps are obviously PP-algebras by the argument used in Lemma .

(Doberkat 03) gives a different representation for the algebras of PP. His representation for the algebras is based upon the idea that we want continuous maps h:P(X)Xh:P(X) \rightarrow X such that the ‘fibres’ are convex and closed, and such that δ x\delta_x, the Delta distribution on xx, is in the fibre over xx. And there’s another condition which requires a compact subset of P(X)P(X) to be sent to a compact subset of XX.

As an example of PP-algebras, represented via convex spaces, Doberkat gives the example of closed and bounded convex subsets of some Euclidean space, and shows that the construction of a barycenter yields an algebra. We summarize that construction here.

Fix X nX \subset \mathbb{R}^n as a bounded, closed, and convex subset of the Euclidean space n\mathbb{R}^n. A vector x nx_{\star} \in \mathbb{R}^n is called a barycenter of the probability measure τP(X)\tau \in P(X) iff, for all linear functionals gg on n\mathbb{R}^n, the property g(x )= Xg(x)dτg(x_{\star}) = \int_X g(x) d\tau holds. Since every linear functional on n\mathbb{R}^n is given by g()=x,g(\cdot)=\langle x, \cdot \rangle for a unique x nx \in \mathbb{R}^n, the defining property of a barycenter (for convex subsets of n\mathbb{R}^n) given above is equivalent to saying that, for all x nx \in \mathbb{R}^n, the property x,x = yXx,ydτ\langle x, x_{\star} \rangle = \int_{y \in X} \langle x, y\rangle d\tau holds.

Lemma

The barycenter of τP(X)\tau \in P(X) exists, it is uniquely determined, and it is an element of XX.

Theorem

Let h(τ)h(\tau) be the barycenter of τP(X)\tau \in P(X). Then (X,h)(X,h) is an algebra for the PP-monad.

The example given by the unit square X=P(2)×P(2)=[0,1]×[0,1] 2X= P(\mathbf{2}) \times P(\mathbf{2})=[0,1] \times [0,1] \subset \mathbb{R}^2 fits into this theory nicely. The barycenter map is given by the marginalization map m:P(P(2)×P(2))P(2)×P(2)m:P( P(\mathbf{2}) \times P(\mathbf{2})) \rightarrow P(\mathbf{2}) \times P(\mathbf{2}). However when the space XX cannot be characterized by a finite number of parameters, the above theory using barycenters directly cannot be applied, even though the marginalization map P(P(X)×P(Y))P(X)×P(Y)P( P(X) \times P(Y)) \rightarrow P(X) \times P(Y) is still a PP-algebra. (It is still a barycenter map but not within the framework of n\mathbb{R}^n.) These barycenter maps are the components of a natural transformation characterizing the counit of an adjunction of the PP-monad.
More information concerning the use of barycenter maps in finding algebras can be found at Radon monad.

Finally, we note that Doberkat points out that for discrete Polish space XX that XX is disconnected, and hence there can be no continuous map PXXP{X} \rightarrow \mathbf{X}. Hence XX, irrelavant of any convex structure we endow it with, cannot be an algebra.

See also monads of probability, measures, and valuations.

Voevodsky’s work

Vladimir Voevodsky has also worked on a category theoretic treatment of probability theory, and gave few talks on this at IHES, Miami, in Moscow etc. Voevodsky had in mind applications in mathematical biology?, for example, population genetics:

See Miami Talk abstract

…a categorical study of probability theory where “categorical” is understood in the sense of category theory. Originally, I developed this approach to probability to get a better understanding of the constructions which I had to deal with in population genetics. Later it evolved into something which seems to be also interesting from a purely mathematical point of view. On the elementary level it gives a category which is useful for the work with probabilistic constructions involving complicated combinations of stochastic processes of different types. On a more advanced level, applying in this context the old idea of a functor as a generalized object one gets a better view of the relationship between probability and the theory of (pre-)ordered topological vector spaces.

A talk in Moscow (20 Niv 2008, in Russian) can be viewed here, wmv 223.6 Mb. Abstract:

In early 60-ies Bill Lawvere defined a category whose objects are measurable spaces and morphisms are Markov kernels. I will try to show how this category allows one to think about many of the notions of probability theory in categorical terms and to connect probabilistic objects to objects of other types through various functors.

Voevodsky’s unfinished notes on categorical probability theory have been released posthumously.

Panangaden’s monad

Prakash Panangaden in Probabilistic Relations defines the category SRelSRel (stochastic relations) to have as objects sets equipped with a σ\sigma-field. Morphisms are conditional probability densities or stochastic kernels. So, a morphism from (X,Σ X)( X, \Sigma_X) to (Y,Σ Y)( Y, \Sigma_Y) is a function h:X×Σ Y[0,1]h: X \times \Sigma_Y \to [0, 1] such that

  1. BΣ Y.λxX.h(x,B)\forall B \in \Sigma_Y . \lambda x \in X . h(x, B) is a bounded measurable function,
  2. xX.λBΣ Y.h(x,B)\forall x \in X . \lambda B \in \Sigma_Y . h(x, B) is a subprobability measure on Σ Y\Sigma_Y.

If kk is a morphism from YY to ZZ, then khk \cdot h from XX to ZZ is defined as (kh)(x,C)= Yk(y,C)h(x,dy)(k \cdot h)(x, C) = \int_Y k(y, C)h(x, d y).

Panangaden’s definition differs from Giry’s in the second clause where subprobability measures are allowed, rather than ordinary probability measures.

Panangaden emphasises that the mechanism is similar to the way that the category of relations can be constructed from the power set functor. Just as the category of relations is the Kleisli category of the powerset functor over the category of sets Set, SRelSRel is the Kleisli category of the functor over the category of measurable spaces and measurable functions which sends a measurable space, XX, to the measurable space of subprobability measures on XX. This functor gives rise to a monad.

What is gained by the move from probability measures to subprobability measures? One motivation seems to be to model probabilistic processes from XX to a coproduct X+YX + Y. This you can iterate to form a process which looks to see where in YY you eventually end up. This relates to SRelSRel being traced.

There is a monad on MeasureSpacesMeasureSpaces, 1+:MeasMeas1 + -: Meas \to Meas. A probability measure on 1+X1 + X is a subprobability measure on XX. Panangaden’s monad is a composite of Giry’s and 1+1 + -.

History

The adjunction underlying the Giry monad was originally developed by Lawvere in 1962, prior to the full recognition of the relationship between monads and adjunctions. Although P. Huber had already shown in 1961 that every adjoint pair gives rise to a monad, it wasn’t until 1965 that the constructions of Eilenberg-Moore, and Kleisli, made the essential equivalence of both concepts manifest.

Lawvere’s construction was written up as an appendix to a proposal to the Arms Control and Disarmament Agency, set up by President Kennedy as part of the State Department to handle planning and execution of certain treaties with the Soviet Union. This appendix was intended to provide a reasonable framework for arms control verification protocols (Lawvere 20).

At that time, Lawvere was working for a “think tank” in California, and the purpose of the proposal was to provide a means for verifying compliance with limitations on nuclear weapons. In the 1980’s, Michèle Giry was collaborating with another French mathematician at that time who was also working with the French intelligence agency, and she was able to obtain a copy of the appendix. Giry then developed and extended some of the ideas in the appendix (Giry 80)

Gian-Carlo Rota had also (somehow) obtained a copy of the appendix, which ended up in the library at The American Institute of Mathematics, and only became publicly available in 2012.

From Lawvere 20:

I’d like to say that the idea of the category of probabilistic mappings, the document corresponding to that was not part of a seminar, as some of the circulations say, essentially it was the document submitted to the arms control and disarmament agency after suitable checking that the Pentagon didn’t disagree with it. Because of the fact that for arms control agencies as a side responsibility the forming of arms control agreements and part of these agreements must involve agreed upon protocols of verification. So the idea of that paper did not provide such protocols, but it purported to provide reasonable framework within which such protocol can be formulated.

References

The idea originates with

and was picked up and published in:

  • Michèle Giry, A categorical approach to probability theory, Categorical aspects of topology and analysis (Ottawa, Ont., 1980), pp. 68–85, Lecture Notes in Math. 915 Springer 1982 (doi:10.1007/BFb0092872)

    (there are allegedly a few minor analytically incorrect points and gaps in proofs, observed by later authors).

Historical comments on the appearance of Lawvere 62 are made in

According to E. Burroni (2009), the Giry monad appears also in

  • O. de la Tullaye, L’intégration considérée comme l’algèbre d’un triple. Rapport de Stage de D.E.A. manuscrit 1971.

The article

shows, in effect, that the Giry monad restricted to countable measurable spaces (with the discrete σ\sigma-algebra) yields the restricted Giry functor G|:Meas cMeasG|: \mathbf{Meas}_c \rightarrow \mathbf{Meas} which has the codensity monad GG. This suggest that the natural numbers \mathbb{N} are ‘’sufficient’‘ in some sense. Indeed, the full subcategory of Polish spaces consisting of the single object NN of all natural numbers with the powerset σ\sigma-algebra is codense in PolPol for the reasons delineated in the proof above - every continuous function PXXP{X} \rightarrow X is completely determined by its values on the countable dense subset of PXP{X}.

The article

views probability measures via double dualization, restricted to weakly averaging affine maps which preserves limits. (A more satisfactory description of probability measures arises from recognizing the need for viewing them as weakly-averaging countably affine maps, rather than just finite affine maps, as discussed in that article.)

Some corrections from an earlier version of that article, were pointed out in

Apart from these papers, there are similar developments in

  • Franck van Breugel, The metric monad for probabilistic nondeterminism, features both the Lawvere/Giry monad and Panangaden’s monad.

  • Ernst-Erich Doberkat, Characterizing the Eilenberg-Moore algebras for a monad of stochastic relations (pdf)

  • Ernst-Erich Doberkat, Kleisli morphisms and randomized congruences, Journal of Pure and Applied Algebra Volume 211, Issue 3, December 2007, Pages 638-664 https://doi.org/10.1016/j.jpaa.2007.03.003

  • N. N. Cencov, Statistical decisions rules and optimal Inference, Translations of Math. Monographs 53, Amer. Math. Society 1982

(blog comment) Cencov’s “category of statistical decisions” coincides with Giry’s (Lawvere’s) category. I (\leftarrow somebody) have the sense that Cencov discovered this category independently of Lawvere although years later.

  • category cafe related to Giry monad: category theoretic probability, coalgebraic modal logic

  • Samson Abramsky et al. Nuclear and trace ideals in tensored ∗-Categories,arxiv:math/9805102, on the representation of probability theory through monads, which looks to work Giry’s monad into a context even more closely resembling the category of relations.

There is also relation with work of Jacobs et al.

J. Culbertson and K. Sturtz use the Giry monad in their categorical approach to Bayesian reasoning and inference (both articles contain further references to the categorical approach to probability theory):

  • Jared Culbertson and Kirk Sturtz, A categorical foundation for Bayesian probability, Applied Cat. Struc. 2013 (preprint as arXiv:1205.1488)

  • Jared Culbertson and Kirk Sturtz, Bayesian machine learning via category theory, 2013 (arxiv:1312.1445)

  • Elisabeth Burroni, Lois distributives. Applications aux automates stochastiques, TAC 22, 2009 pp.199-221 (journal page)

where she derives stochastic automata as algebras for a suitable distributive law on the monoid and Giry monads.

B. Fong has a section on the Giry monad in his paper on Bayesian networks:

  • Fong: Causal Theories - A Categorical Perspective on Bayesian Networks, (2013) arXiv:1301.6201

See also:

Discussion of the Giry monad extended to simplicial sets and used to characterize quantum contextuality via simplicial homotopy theory:

exposition:

category: probability

Last revised on August 9, 2024 at 03:38:07. See the history of this page for a list of all contributions to it.