Lazy Markov chain
= Lazy Markov chain
{wiki}
Under the usual discrete-time convention, a <Lazy Markov chain> has <holding probability of a Markov chain>[holding probability] at least $1/2$ at every state. Starting with <transition matrix> $P$, its standard lazy version is
$$
P_{\mathrm L}=\tfrac12I+\tfrac12P.
$$
Toss a fair coin at each step: stay put on one outcome and perform a $P$ transition on the other. Every <Stationary distribution> of $P$ is stationary for $P_{\mathrm L}$, because $\pi P_{\mathrm L}=(\pi+\pi P)/2=\pi$. An <communicating class>[irreducible class] becomes <aperiodic Markov chain>[aperiodic] because of its <self-loop>[self-loops].
More generally, adding the same <holding probability of a Markov chain>[holding probability] $a\in(0,1)$ at every state gives $aI+(1-a)P$ and preserves <stationary distributions>, although the conventional half-holding threshold need not hold. For a reversible chain, half-laziness sends each <eigenvalue> $\lambda\in[-1,1]$ to $(1+\lambda)/2\geq0$, explaining why ordinary and absolute spectral gaps then coincide.
State-dependent holding can change <stationary distribution>[stationarity]. Begin with the alternating two-state chain, whose <Stationary distribution> is $(1/2,1/2)$. Holding at state zero with <Probability> $9/10$ and at state one with <Probability> $1/2$ produces $\begin{pmatrix}9/10&1/10\\1/2&1/2\end{pmatrix}$ with <Stationary distribution> $(5/6,1/6)$. Thus uniform slowing preserves the invariant law; arbitrary extra <self-loop>[self-loops] need not.