Capstone 2 - Probability and Brownian Motion
Simulate, estimate, and validate the building blocks of continuous-time finance: distributions, the CLT, and Brownian motion’s defining properties.
Leads to: Brownian motion built and validated here is the driver of every SDE and pricing model in Capstones 3–4.
Learning Objectives
Click a status chip to cycle: Not started → In progress → Studied → Practiced → Needs review → Mastered.
- Simulate standard Brownian motion and verify its mean, variance, and independent-increment structure.
- Demonstrate the central limit theorem empirically and quantify the sampling error.
- Estimate a distribution’s moments and validate against closed-form values with confidence intervals.
- Verify the quadratic variation of Brownian motion converges to \(t\).
- Explain why Brownian paths are continuous but nowhere differentiable, and what that implies for scaling.
Key Vocabulary
- Brownian motion
- A process \(W_t\) with \(W_0=0\), independent Gaussian increments \(W_t-W_s\sim\Normal(0,t-s)\), and continuous paths.
- Central limit theorem
- Normalized sums of i.i.d. finite-variance variables converge in distribution to a normal.
- Quadratic variation
- The limit \(\sum(W_{t_{i+1}}-W_{t_i})^2\to t\); nonzero, unlike for smooth functions.
- Standard error
- The standard deviation of an estimator; for a mean of \(n\) draws it is \(\sigma/\sqrt n\).
- Independent increments
- Non-overlapping increments of \(W\) are independent - the Markov backbone of the process.
- Scaling law
- Brownian increments scale like \(\sqrt{\Delta t}\), not \(\Delta t\); the root of the \(\sqrt{dt}\) in simulation.
Intuition & Motivation
This capstone also cements the two statistical facts that make simulation trustworthy: the central limit theorem (why averages of many draws are approximately normal) and the standard error \(\sigma/\sqrt n\) (how precise your estimate is). Together they let you attach an honest confidence interval to every simulated quantity.
The brief
Build a Brownian-motion simulator and a small estimation harness, then validate four properties against theory, each with a quantified error. Deliverable: code plus a validation report stating, for each property, the predicted value, the estimate, and a confidence interval.
Required theory recap
- Distributions & moments (Phase 7): \(\E[W_t]=0,\ \Var(W_t)=t\); for the sample mean, SE \(=\sigma/\sqrt n\).
- CLT (Phase 7): \(\frac{1}{\sqrt n}\sum_{i=1}^n \frac{X_i-\mu}{\sigma}\xrightarrow{d}\Normal(0,1)\).
- Brownian motion (Phase 8): \(W_t-W_s\sim\Normal(0,t-s)\), independent increments, continuous paths, quadratic variation \(=t\).
- Monte Carlo (Phase 13): estimate \(\E[g(W)]\) by averaging over simulated paths; error \(\propto 1/\sqrt{N}\).
Simulating Brownian motion correctly
On a grid \(0=t_0\lt \dots\lt t_n=T\) with step \(\Delta t\), generate increments and cumulate:
Quadratic variation: the signature of Brownian motion
For a smooth function, \(\sum(\Delta f)^2\to0\) as the grid refines. For Brownian motion it converges to the elapsed time:
CLT and honest error bars
To estimate \(\theta=\E[g(W_T)]\) by Monte Carlo, average \(N\) independent path values. The CLT gives an approximate 95% confidence interval:
Reporting \(\hat\theta\) without this interval is the single most common sin in simulation: it hides whether ‘0.502’ is distinguishable from ‘0.5’.
The simulator takes a seed and returns a clean array (17.3 reproducibility); every validation reports an interval, not a bare point.
- Using \(\Delta t\) instead of \(\sqrt{\Delta t}\) for the increment SD - the classic scaling error.
- Reporting a Monte Carlo estimate with no standard error, so you can’t tell signal from noise.
- Concluding the estimate is ‘wrong’ when it is within a couple of standard errors of the truth (it isn’t).
- Expecting quadratic variation to be zero (that’s smooth functions) or exactly \(T\) on one finite path.
- Treating overlapping increments as independent when checking the independence property.
- Assuming Brownian paths are differentiable and trying to define an ordinary derivative \(dW/dt\).
- Always simulate increments as \(\sqrt{\Delta t}\,Z\) and cumulative-sum; validate \(\Var(W_T)\approx T\).
- Attach a \(\pm1.96\,\hat s/\sqrt N\) interval to every estimate; grow \(N\) until it’s tight enough.
- Use quadratic variation as a built-in unit test that your path generator is really Brownian.
- Check independence via the sample correlation of non-overlapping increments (should be ~0).
- Fix the seed so the validation report is reproducible and re-checkable (17.3).
Interactive: simulate Brownian motion and validate its properties
Implement the simulator and the two validators (variance and quadratic variation). The tests encode the theoretical values with tolerances derived from the standard errors above.
Knowledge Check
Practical Exercise
You must convince a skeptical reviewer that your path generator really produces standard Brownian motion. List four independent checks you would run, the theoretical value each targets, and the approximate standard error of each check for \(N\) paths on \([0,1]\) with \(n\) steps.
Four checks a correct BM must pass:
- Mean: \(\E[W_1]=0\); estimate \(\bar W_1\) over \(N\) paths, SE \(=1/\sqrt N\). Reject if \(|\bar W_1|\gt 1.96/\sqrt N\).
- Variance: \(\Var(W_1)=1\); sample variance of \(W_1\), SE \(\approx\sqrt{2/N}\) (variance of a normal’s sample variance).
- Independent increments: correlation between \(W_{0.5}-W_0\) and \(W_1-W_{0.5}\) should be ~0; SE of a correlation \(\approx1/\sqrt N\).
- Quadratic variation: per path \(\sum(\Delta W)^2\to1\) with SD \(\sqrt{2/n}\); average over paths to tighten.
Each check reports predicted value, estimate, and a \(\pm1.96\,\text{SE}\) band. Passing all four - not just one - is what earns trust; a generator can match the mean while botching the increment scaling.
Lesson Summary
Retrieval Practice
Close the lesson and answer from memory before checking. This is deliberate, effortful recall - the single highest-yield study action.
A: \(W_{t_{k+1}}=W_{t_k}+\sqrt{\Delta t}\,Z_k,\ Z_k\sim\Normal(0,1)\). The \(\sqrt{\Delta t}\) (variance = elapsed time) is essential; using \(\Delta t\) is the classic bug.
A: It converges to \(T\) (in probability), not 0. This nonzero quadratic variation is exactly what forces the second-order term in Itô’s lemma and distinguishes BM from smooth paths.
Completion Checklist
- I can explain the core ideas in my own words
- I worked the derivations/examples by hand
- I completed the interactive workbench(es)
- I passed the knowledge check
Source References
This lesson synthesizes and paraphrases concepts from the sources below. No copyrighted text, problem sets, or solutions are reproduced. Return to the originals for full depth.
- Probability: Theory and Examples (Rick Durrett, 5th ed.) current - Ch. 3, 7 - Central limit theorem, moments, and the construction/properties of Brownian motion.
- Brownian Motion and Stochastic Calculus (Karatzas & Shreve, 2nd ed., GTM 113) foundational - Ch. 1-2 - Brownian motion: independent increments, continuity, and quadratic variation \(=t\).
- Monte Carlo Methods in Financial Engineering (Paul Glasserman, 2004) foundational - Ch. 3 - Path simulation of Brownian motion and Monte Carlo standard-error estimation.