MathCastle
Linear AlgebraChallengeMarkov Chains & Long-Run Behavior

Markov Chains & Long-Run Behavior · Challenge problem

A two-state chain has transition matrix M=(3/41/41/43/4)M = \begin{pmatrix} 3/4 & 1/4 \\ 1/4 & 3/4 \end{pmatrix} and starts in state 1. Let pnp_n be the probability that it is in state 1 after nn steps. What is the smallest nn with pn<0.501p_n < 0.501?