Quant Memo
Foundational

The Random Walk

A random walk is a running total of independent random steps, the simplest model of a price wandering with no memory. Its defining feature is that typical distance from the start grows like the square root of time, not time itself.

Prerequisites: Variance, Intuitively

Picture someone standing on a number line who flips a coin each second: heads they step one unit right, tails one unit left. Their position is a random walk, the running sum of independent ±1\pm 1 steps. It's the plainest model of something that drifts nowhere on purpose but wanders anyway, and it's the discrete ancestor of how quants model prices.

Write the steps as X1,X2,X_1, X_2, \dots, each equal to +1+1 or 1-1 with probability 12\tfrac12. The position after nn steps is their cumulative sum:

Sn=X1+X2++Xn.S_n = X_1 + X_2 + \cdots + X_n .

Each symbol is small: XiX_i is a single coin-flip step, and SnS_n is where you stand after nn of them. The path is jagged and unpredictable step to step, yet its statistics are strikingly regular.

0 start +6 each step is +1 or −1, decided by a coin flip
A single random walk: it steps up or down by one at each tick, drifting away from zero without any trend pushing it.

The two numbers that describe it

Because each step averages to zero, the walk's expected position is always zero, no matter how long it runs:

E[Sn]=E[X1]++E[Xn]=0.E[S_n] = E[X_1] + \cdots + E[X_n] = 0 .

The spread is the interesting part. Each step has variance 11, and independent variances add (from variance), so

Var(Sn)=n,σSn=n.\mathrm{Var}(S_n) = n, \qquad \sigma_{S_n} = \sqrt{n} .

That square root is the headline result. Typical distance from the start grows like n\sqrt{n}, not nn. The walk keeps wandering, but ever more slowly relative to the clock.

The signature of a random walk: expected position stays 00, but typical distance from the start grows as n\sqrt{n}, not nn. To wander twice as far you must run the walk four times as long — the same time\sqrt{\text{time}} diffusion that carries into Brownian motion.

Worked example: how far after many steps?

After n=100n = 100 steps, the expected position is still 00, but the standard deviation is 100=10\sqrt{100} = 10. So a typical endpoint is about ten units from the origin, and by the The Central Limit Theorem the position is approximately normal, meaning you'd land beyond ±20\pm 20 (two sigma) only about 5%5\% of the time.

Now push to n=10,000n = 10{,}000 steps, a hundred times longer. The spread is only 10,000=100\sqrt{10{,}000} = 100, ten times wider, not a hundred. To double how far you typically roam, you must run the walk four times as long. This time\sqrt{\text{time}} scaling is exactly the diffusion behavior that carries over to Brownian Motion, the continuous-time limit of the random walk.

Common pitfalls

  • Zero drift is not zero risk. The expected position never moves, yet the range of where you might be keeps widening. "Fair on average" and "safe" are different claims.
  • Distance grows like n\sqrt{n}, not nn. Assuming the walk drifts proportionally to time is the single most common error; it overstates long-run movement badly.
  • No memory, no reversion. A pure random walk does not get "pulled back" after a run of heads. Believing losses must reverse is the gambler's fallacy.
  • Independence is doing the work. The clean Var(Sn)=n\mathrm{Var}(S_n)=n relies on steps being independent. If steps are correlated, the variance no longer adds so simply.

Zero drift is not zero risk: the average position never moves, yet the range of where you might be keeps widening. And a walk has no memory — a run of heads is never "due" to reverse. Believing losses must bounce back is the gambler's fallacy.

The random walk is the bridge from coin flips to continuous price models: it's a martingale (a fair game with no predictable drift), its endpoint is normal by the The Central Limit Theorem, and its scaling limit is Brownian Motion, the engine under most of quantitative finance.

Related concepts

Practice in interviews

Further reading

  • Ross, A First Course in Probability
  • Feller, An Introduction to Probability Theory, Vol. 1
ShareTwitterLinkedIn