Coupling from the past
Builds on Markov chainTransition matrixStationary distributionContinuous uniform distributionCoupling
Definition
Let be a finite set and let be the transition matrix of an irreducible and aperiodic Markov chain on . Let be its stationary distribution. Let be an update function: if is uniform on , then for all . Let be independent and uniform on . For define the map by Coupling from the past is the algorithm that computes for , always with the same . It stops at the first such for which is constant, and it outputs the common value .
Remarks
If is finite almost surely, the output has law exactly . Indeed, has the same constant value for all , while has law , which tends to . Example: take a chain that jumps to a fresh sample of at each step, with an update that does not depend on . Then is constant, and the output has law . Non-example: running the coupled copies forward from time and outputting their value at the first meeting time is biased. Take , for , otherwise, and . Then the forward copies always meet at , while . If has a partial order with a top and a bottom element and is monotone, it suffices to follow the top and the bottom states.
Reading path
To understand this page from the ground up, read these 55 pages in order. The foundations come first.
- Construction of the reals from Cauchy sequences concept
- Continuous uniform distribution concept
- Coupling concept
- Element definition
- Integers object
- Ordered field definition
- Proposition concept
- Random experiment concept
- Rational numbers object
- Real numbers object
- Stationary distribution concept
- Transition matrix concept
- Set definition
- Ring of integers statement
- Disjunction definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Union definition
- Sample space definition
- Existential quantifier definition
- Universal quantifier definition
- The rationals form a field statement
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- The rationals form an ordered field statement
- Binary relation definition
- Universal set definition
- Power set definition
- Order on the reals definition
- Function definition
- Complement definition
- Interval definition
- Injective function definition
- Preimage of a set definition
- Sigma-algebra definition
- Countable set definition
- Event definition
- Borel sigma-algebra definition
- Probability axioms concept
- Probability measure definition
- Probability space definition
- Conditional probability definition
- Random variable definition
- Independence of two events definition
- Discrete random variable definition
- Stochastic process concept
- Random variable with a density definition
- Conditional independence definition
- Expected value definition
- Conditional expectation definition
- Markov property definition
- Markov chain definition
- Coupling from the past definition
Further reading
About this page
| Tag | CA6SVPFR3G |
|---|---|
| URI | m2://CA6SVPFR3G |
| Kind | definition |
| Writing | W0 stub |
| MSC | 65C05, 60J10, 60J22 |
| Defines | Coupling from the past |
| Uses | Markov chain, Transition matrix, Stationary distribution, Continuous uniform distribution, Coupling |
| 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.
What links here
No page links to this page yet.