Introduction to Probability · Problem 11.16

Random Walks — Grinstead & Snell

Mathematics — Probability · markov-chains-ergodic

Problem

(Crowell) Let P\mathbf{P} be the transition matrix of an ergodic Markov chain. Show that (I+P+⋯+Pn−1)(I−P+W)=I−Pn+nW,(\mathbf{I} + \mathbf{P} + \cdots + \mathbf{P}^{n-1})(\mathbf{I} - \mathbf{P} + \mathbf{W}) = \mathbf{I} - \mathbf{P}^n + n\mathbf{W}, and from this show that I+P+⋯+Pn−1n→W,\frac{\mathbf{I} + \mathbf{P} + \cdots + \mathbf{P}^{n-1}}{n} \to \mathbf{W}, as n→∞n \to \infty.

Related theory

Browse the problem library