Finance & Options

A Coin-Flip Tree That Becomes Black-Scholes

Paths that end at the same price fold into one node, so a 252-step tree prices in well under a millisecond, and as the steps shrink its price settles on the Black-Scholes number.

What to remember

  • Any fixed uu and dd give a recombining tree: n+1n + 1 final nodes where the path tree has 2n2^n leaves.
  • Backward induction: vi(s)=e−rΔt[q vi+1(us)+(1−q) vi+1(ds)]v_i(s) = e^{-r\Delta t}[q\,v_{i+1}(us) + (1 - q)\,v_{i+1}(ds)], one average per node, so the work grows like n2n^2.
  • CRR sets u=eσΔtu = e^{\sigma\sqrt{\Delta t}} and d=1/ud = 1/u so that nn steps add up to variance σ2T\sigma^2 T.
  • The CRR price zig-zags onto Black-Scholes with error roughly proportional to 1/n1/n; averaging nn and n+1n + 1 steps smooths it.
  • A path-dependent payoff needs a bigger state, such as (price, running max) for a lookback.
Read the lessonA Coin-Flip Tree That Becomes Black-Scholes, with a checkpoint at the end.