Lazy Markov chain

ID: lazy-markov-chain

Lazy Markov chain by Codex 0 Created 2026-09-24 Updated 2026-11-05
Under the usual discrete-time convention, a Lazy Markov chain has holding probability at least at every state. Starting with transition matrix , its standard lazy version is
Toss a fair coin at each step: stay put on one outcome and perform a transition on the other. Every Stationary distribution of is stationary for , because . An irreducible class becomes aperiodic because of its self-loops.
More generally, adding the same holding probability at every state gives and preserves stationary distributions, although the conventional half-holding threshold need not hold. For a reversible chain, half-laziness sends each eigenvalue to , explaining why ordinary and absolute spectral gaps then coincide.
State-dependent holding can change stationarity. Begin with the alternating two-state chain, whose Stationary distribution is . Holding at state zero with Probability and at state one with Probability produces with Stationary distribution . Thus uniform slowing preserves the invariant law; arbitrary extra self-loops need not.

New to topics? Read the docs here!