Markov Chains

State-based stochastic processes governed by transition matrices, stationary distributions, and long-run convergence.

A two-state Markov chain: tomorrow depends on today
SunnyRainy0.20.40.80.6
Definition

A Markov chain is a process that moves between states, where the next state depends only on the current state:

P(Xt+1=jโˆฃXt=i,Xtโˆ’1,โ€ฆ,X0)=P(Xt+1=jโˆฃXt=i).P(X_{t+1}=j \mid X_t=i, X_{t-1},\ldots,X_0) = P(X_{t+1}=j \mid X_t=i).

This is the Markov property. The chain remembers where it is, but not how it got there.

For example, a weather model might use two states, Sunny and Rainy. If today is Sunny, tomorrow might be Sunny with probability 0.80.8 and Rainy with probability 0.20.2. If today is Rainy, tomorrow might be Sunny with probability 0.40.4 and Rainy with probability 0.60.6.

A two-state chain

The weather model can be written as the transition matrix

P=(0.80.20.40.6),P = \begin{pmatrix} 0.8 & 0.2 \\ 0.4 & 0.6 \end{pmatrix},

where rows are today's state and columns are tomorrow's state. If the state order is (Sunny,Rainy)(\text{Sunny}, \text{Rainy}), then the first row says Sunny โ†’\to Sunny with probability 0.80.8 and Sunny โ†’\to Rainy with probability 0.20.2.

Try it

Why must each row of a transition matrix sum to 11?

Solution

From any current state, the chain must go somewhere next. The row lists all possible next-state probabilities from that current state, so those probabilities must add to 11.

Related concepts