Quant Memo
Core

CRR And Jarrow-Rudd Tree Parameters

There is more than one honest way to draw a binomial tree that converges to the same lognormal answer — CRR keeps the grid symmetric and adjusts the odds, Jarrow-Rudd keeps the odds fair and adjusts the grid.

Prerequisites: Binomial Option Pricing, Risk-Neutral Pricing, Geometric Brownian Motion

A binomial tree needs three numbers per step: how far up, how far down, and with what probability. There are infinitely many ways to pick those three numbers so that, as the number of steps grows, the tree converges to the same lognormal distribution. Two choices became standard because each simplifies a different piece of arithmetic — Cox-Ross-Rubinstein (CRR) makes the up and down moves mirror images of each other, and Jarrow-Rudd (JR) makes the probability of each move exactly one half.

Two ways to draw the same grid

Imagine drawing graph paper for a hiking map. One convention makes every grid square exactly the same size and lets the hiker's odds of going left or right vary by terrain (CRR: fixed step sizes, solved-for probability). A second convention insists the hiker always has 50/50 odds at every junction, and instead makes some grid squares wider than others to reflect that (JR: fixed 50/50 probability, solved-for step sizes). Both maps describe the same mountain in the end; they just put the complexity in different places.

CRR:u=eσΔt,  d=1u,  p=erΔtdud\text{CRR:}\quad u = e^{\sigma\sqrt{\Delta t}}, \; d = \frac{1}{u}, \; p = \frac{e^{r\Delta t} - d}{u - d} Jarrow-Rudd:u=e(r12σ2)Δt+σΔt,  d=e(r12σ2)ΔtσΔt,  p=12\text{Jarrow-Rudd:}\quad u = e^{(r - \frac12\sigma^2)\Delta t + \sigma\sqrt{\Delta t}}, \; d = e^{(r - \frac12\sigma^2)\Delta t - \sigma\sqrt{\Delta t}}, \; p = \tfrac12

In plain English: CRR fixes uu and dd as symmetric reciprocals (u×d=1u \times d = 1) and solves for whatever probability pp makes the tree's average growth rate match the risk-free rate. Jarrow-Rudd instead fixes the coin flip at exactly fair odds and shifts the up and down move sizes themselves — both by the same drift term, offset by ±σΔt\pm\sigma\sqrt{\Delta t} — so that the average of the two outcomes matches the right growth rate instead.

Worked example 1: comparing the two parameterisations. Take σ=25%\sigma=25\%, r=5%r=5\%, Δt=1\Delta t=1 month =1/12=1/12. For CRR: u=e0.251/12=e0.0722=1.0749u=e^{0.25\sqrt{1/12}}=e^{0.0722}=1.0749, d=1/1.0749=0.9303d=1/1.0749=0.9303, and p=(e0.05/120.9303)/(1.07490.9303)=(1.004170.9303)/0.1446=0.0739/0.1446=0.5111p=(e^{0.05/12}-0.9303)/(1.0749-0.9303)=(1.00417-0.9303)/0.1446=0.0739/0.1446=0.5111. For Jarrow-Rudd: the drift term is (0.050.03125)/12=0.001563(0.05-0.03125)/12=0.001563, so u=e0.001563+0.0722=e0.0737=1.0765u=e^{0.001563+0.0722}=e^{0.0737}=1.0765 and d=e0.0015630.0722=e0.0706=0.9318d=e^{0.001563-0.0722}=e^{-0.0706}=0.9318, with pp fixed at 0.50.5 exactly. Notice CRR's up-move (1.0749) and JR's up-move (1.0765) are close but not identical — CRR pushed the asymmetry into probability (0.5111 vs 0.5), JR pushed it into the move sizes instead.

CRR $u$, $p=0.511$ $d$, $1-p$ Jarrow-Rudd $u'$, $p=0.5$ $d'$, $p=0.5$
Same starting node, same lognormal destination — CRR keeps the ladder rungs symmetric and lets the odds carry the drift; Jarrow-Rudd keeps the odds fair and lets the rungs carry it instead.

Worked example 2: they still converge to the same price. Price a 3-month at-the-money call, S=K=100S=K=100 (a $100 stock), using both trees with, say, 50 steps each. The Black-Scholes benchmark is about $5.71. Both CRR and JR trees typically land within a few cents of that value at 50 steps, and both converge to it exactly as the step count grows — the difference between them shows up in how they converge (CRR tends to oscillate around the true value from one step-count to the next; JR tends to approach more smoothly but can be more sensitive to a very coarse number of steps), not in what they converge to.

Path explorer
13445time →
end (bold path) 94.98spread of ends 66.586 independent paths, same settings

Both trees are discrete approximations of the same continuous path shown above — as steps increase, the CRR ladder and the JR ladder both flatten into this same random walk.

What this means in practice

CRR remains the default in most textbooks and production pricers because its symmetric u=1/du=1/d structure is simple to code and recombines cleanly (an up-then-down move lands on the same node as a down-then-up move). Jarrow-Rudd is preferred when a fixed, intuitive 50/50 branching probability matters more than symmetric step sizes — for instance, when building the tree by hand or explaining it to someone new to the method.

A common mistake is assuming CRR's probability pp is a real-world probability of the stock going up. It isn't — it's the risk-neutral probability that makes the discounted tree arbitrage-free, and at typical parameters it's close to, but not exactly, one half. Confusing it for an actual forecast of direction is a category error the tree's own construction doesn't prevent.

CRR and Jarrow-Rudd are two different, equally valid ways to fit a binomial lattice to the same lognormal limit: CRR keeps up/down moves symmetric and solves for probability, Jarrow-Rudd fixes the probability at one half and solves for the move sizes.

Related concepts

Practice in interviews

Further reading

  • Cox, Ross & Rubinstein (1979), Option Pricing: A Simplified Approach
  • Jarrow & Rudd (1983), Option Pricing
ShareTwitterLinkedIn