nLab iid random variables

Redirected from "iid samples".
Contents

Contents

Idea

In probability theory, iid is shorthand for independent and identically distributed, and it’s mostly used for random variables.

The notion of such random variable formalizes the idea of repeated independent coin flips or dice rolls: they are independent events in that the probability of each event (for example, each single coin flip) follows the same distribution.

Another name for the same process is Bernoulli process.

Definition

Let XX be a measurable space. Random variables or random elements in a sequence f n:ΩXf_n \colon \Omega\to X on a probability space (Ω,μ)(\Omega,\mu) are said to be iid, or independent and identically distributed, if their joint distribution pp is in the form qqqq\otimes q\otimes\dots\otimes q for some measure qq on XX. Equivalently, if for all measurable subsets A 1,,A nA_1,\dots,A_n of XX,

p(A 1××A n)=q(A 1)q(A n). p(A_1\times\dots\times A_n) \;=\; q(A_1)\cdots q(A_n) \,.

A similar definition can be given for infinite products as well, by means of the Kolmogorov extension theorem.

Sometimes, especially when the space XX is finite (particularly when it has two elements, such as for coin flips), one calls the resulting stochastic process a Bernoulli process.

iid samples

Given a probability distribution pp on XX, one can take iid samples. This can be described as a Markov kernel samp :PX(PX) X samp_\mathbb{N}:P X\to (P X)^\mathbb{N}\to X^\mathbb{N} where:

  • The kernel PX(PX) P X\to (P X)^\mathbb{N} is the kernel induced by the function p(p,p,)p\mapsto (p,p,\dots);
  • The kernel (PX) X (P X)^\mathbb{N}\to X^\mathbb{N} is induced by taking many tensor copies of the sampling map. (One can take infinitely many copies by means of the Kolmogorov extension theorem.)

Explicitly, the kernel samp :PXX samp_\mathbb{N}:P X\to X^\mathbb{N} is given as follows:

samp (A 1××A n|p)=p(A 1)p(A n), samp_\mathbb{N}(A_1\times\dots\times A_n|p) \;=\; p(A_1)\cdots p(A_n) ,

where again we make use of the Kolmogorov extension theorem to define the kernel in terms of its finite marginals.

One way of stating de Finetti's theorem is by saying that the map samp :PXX samp_\mathbb{N}:P X\to X^\mathbb{N} is a limit cone over an exchangeable process.

In categorical probability

In categorical probability, for example in Markov categories, independence is simply encoded by taking the tensor product of morphisms (for example, from the monoidal unit).

In Markov categories, one can model iid samples using the copy map (see at Markov category), together with Kolmogorov products.

Properties

See also

References

See also:

category: probability

Last revised on September 28, 2024 at 16:57:37. See the history of this page for a list of all contributions to it.