Markov Chains
State-based stochastic processes governed by transition matrices, stationary distributions, and long-run convergence.
A Markov chain is a process that moves between states, where the next state depends only on the current state:
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 and Rainy with probability . If today is Rainy, tomorrow might be Sunny with probability and Rainy with probability .
The weather model can be written as the transition matrix
where rows are today's state and columns are tomorrow's state. If the state order is , then the first row says Sunny Sunny with probability and Sunny Rainy with probability .
Why must each row of a transition matrix sum to ?
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 .