Skip to content
Probability II / Discrete-Time Markov Chains

Worked Examples — Markov Chain Applications: Credit Migration, PageRank, and an MCMC Preview

This capstone runs the full toolkit built across this topic — classification, stationary distributions, detailed balance, convergence, exit analysis — on three applications chosen for their reach beyond finance: a full end-to-end credit-migration calculation, the linear-algebra idea behind PageRank, and a first look at how a designed Markov chain can be used to sample from an arbitrary target distribution (the idea underlying Markov chain Monte Carlo, taken up properly in the discrete martingales topic's more advanced simulation methods and in portfolio credit risk's model-calibration workflows).
Learning objectives. By the end of this note you should be able to:
  • carry a credit-migration matrix through classification, stationary-distribution, and exit-time analysis end-to-end;
  • explain the linear-algebra idea behind PageRank as a stationary-distribution computation;
  • state the Metropolis-Hastings acceptance rule and explain why it produces a chain with a prescribed stationary distribution.

In this lesson

  1. Credit migration, end to end
  2. PageRank as a stationary distribution
  3. An MCMC preview: the Metropolis-Hastings idea

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.