Past exam of the computer science course of the University of Oxford 2019 Algorithms 2 d Solution 2026-10-25
Let and choose any column probability vector , for example the first coordinate unit vector. Because has nonnegative entries and each row sums to one, maps the probability simplexinto itself: and .
The iterates need not converge, so take their arithmetic averages,A telescoping sum givesBoth vectors on the right before subtraction have L1 norm one, so .
The probability simplex is closed and bounded in finite-dimensional Euclidean space, hence compact by the Heine-Borel theorem. It follows that a subsequence converges to some . Passing to the limit in the displayed identity, using continuity of the linear map , gives , with and .
This proves stationary distribution existence for a finite Markov chain without any Markov chain irreducibility or aperiodicity assumption. Those stronger hypotheses concern uniqueness and convergence, not the existence required here.
Probability vector 2026-10-25
A probability vector lists the probabilities of the outcomes in a finite sample space. Its entries are nonnegative and sum to one, so a column probability vector is a point of a probability simplex. Row and column conventions describe the same probability distribution, but they determine whether a stochastic matrix acts on the right or its transpose acts on the left.
Every finite Markov chain has a stationary distribution, without requiring Markov chain irreducibility or aperiodicity. For a row-stochastic matrix , put and choose a column probability vector . Every lies in the probability simplex. Their arithmetic averages therefore lie in this compact set, while telescoping givesA convergent subsequence has a limit in the probability simplex. Continuity of matrix multiplication gives , so is a stationary distribution. The individual iterates need not converge: a deterministic two-state swap alternates its point masses forever.