Finite Markov chain
= Finite Markov chain
A <finite Markov chain> is a <Markov chain> with a finite <state space>, represented in discrete time by a <transition matrix> $P$ whose entries are nonnegative and whose rows sum to one. A row-vector distribution evolves by $\mu_n=\mu_0P^n$. Every such chain has a <stationary distribution>; irreducibility makes it unique and positive, while aperiodicity additionally ensures <convergence> from every starting distribution. For $P=\left(\begin{smallmatrix}0&1\\1&0\end{smallmatrix}\right)$ the stationary distribution is $(1/2,1/2)$, but a chain started at one state alternates forever and does not converge.<Introduction to Probability by Charles M. Grinstead and J. Laurie Snell>[§§11.1,11.3–11.4]{ref}