Probability theory and stochastic processes Conditioning Concept
Markov kernel
Summary
A Markov kernel from a space to a space assigns to each point of a probability measure on . The assignment must be measurable in the point. It generalises the transition matrix of a Markov chain to arbitrary state spaces. Kernels describe random transitions, conditional distributions and randomised maps. They can be composed, and together with a starting measure they build measures on product spaces.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 2AVNDP8BJP |
|---|---|
| URI | m2://2AVNDP8BJP |
| Kind | concept |
| Writing | W0 stub |
| MSC | 60J05, 28A35 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.