5.3 Approximation of Brownian Motion by Coin-Flipping Sums
5.3 Approximation of Brownian Motion by
Coin-Flipping Sums
Rating
Mathematically Mature: may contain mathematics beyond calculus with
proofs.
Section Starter Question
Suppose you know the graphy=f(x) of the functionf(x). What is the
effect on the graph of the transformationf(ax) wherea >1? What is the
effect on the graph of the transformation (1/a)f(x) wherea >1? What
about the transformationf(ax)/bwherea >1 andb >1.
Key Concepts
- Brownian motion can be approximated by a properly scaled “random
fortune” process (i.e. random walk). - Brownian motion is the limit of “random fortune” discrete time pro-
cesses (i.e. random walks), properly scaled. The study of Brownian
motion is therefore an extension of the study of random fortunes.
Vocabulary
- We defineapproximate Brownian MotionWˆN(t) to be the rescaled
random walk with steps of size 1/
√
Ntaken every 1/Ntime units where
N is a large integer.
Mathematical Ideas
6.3 Properties of Geometric Brownian Motion
As we have now assumed many times,i≥1 let
Yi=
{
+1 with probability 1/2
−1 with probability 1/2