Skip to content
Probability II / Discrete-Time Markov Chains

Multistep Transition Probabilities and the Chapman-Kolmogorov Equations

A one-step transition matrix tells you the probability of moving from rating BBB to rating A next year. A risk manager usually wants the probability of moving from BBB to A over a five-year horizon — a genuinely different question, since the bond could pass through several intermediate ratings along the way. This note shows that the mm-step transition probability is simply the transition matrix raised to the mmth power, and proves the Chapman-Kolmogorov equation that makes this true — the algebraic engine behind every multi-period Markov-chain calculation in this unit.
Learning objectives. By the end of this note you should be able to:
  • compute a two-step transition probability directly from the Markov property and the definition of conditional probability;
  • state and prove the Chapman-Kolmogorov equation;
  • conclude that pm(i,j)p^m(i,j) is the (i,j)(i,j) entry of pmp^m, the mmth matrix power;
  • compute multistep probabilities for a small chain by hand or by matrix multiplication.

In this lesson

  1. Warming up: a two-step calculation
  2. The Chapman-Kolmogorov equation
  3. Worked example: gambler's ruin over multiple plays

The full lesson, with worked examples and exercise solutions, is for members.

Read the full lesson

New to SelfMadeQuant.com? See membership options or explore the curriculum.