Quantnotes.com
Help Contact
Fundamentals
Publications
Software & Data
Book Reviews
Job Listings
Event Listings
Forums
Edutainment
Useful Links
About Us

 

QuantFinanceJobs.com

:: Collaborations ::

:: QF Journal ::

 

:: The Simple Random Walk ::

Consider a person that is allowed to take either a step forward or backward depending on the outcome of a random event Z={-1,+1}. At fixed time intervals he has a constant probability p to move forward (Z=+1)  and a probability q=1-p to move backward (Z=-1). During any one interval the expected displacement (E(Z)) and variance (Var(Z)) is:

[Graphics:Images/randomwalk_gr_1.gif]

We are interested in knowing where the person will likely be with respect to his starting position,after he has taken n steps. We denote this displacement as [Graphics:Images/randomwalk_gr_2.gif]. The outcome of the random event Z has the Markov property. This simply means that the  next step is independent from any of its previous outcomes. So this allows us to linearly scale up all the moments of the displacement by a factor of n. An important result that follows is that since the number of steps taken n, is proportional to the time duration, the variance of a random walk increases linearly with time.

[Graphics:Images/randomwalk_gr_3.gif]

What is his probability p([Graphics:Images/randomwalk_gr_4.gif]) for the person to be at position  [Graphics:Images/randomwalk_gr_5.gif] steps in front of his initial position after he has taken these n steps?He could have reached this position by a number of different ways,but we know that for each,the total number of forward steps taken f minus the number of backward steps taken b must be equal to [Graphics:Images/randomwalk_gr_6.gif] (i.e.[Graphics:Images/randomwalk_gr_7.gif]=f-b).Let us consider just one of the possible ways he could have reached position [Graphics:Images/randomwalk_gr_8.gif].The probability of doing so is [Graphics:Images/randomwalk_gr_9.gif][Graphics:Images/randomwalk_gr_10.gif].This is the same for all the different combinations of choosing f forward steps out of n total steps. So all we need to do multiply this probability by the total number of ways in reaching his final position.

[Graphics:Images/randomwalk_gr_11.gif]

Recall that a binomial random variable has distribution:

[Graphics:Images/randomwalk_gr_12.gif]

So we see that the number of forward and the number of backward steps each have a binomial distribution. There combination gives the displacement in the case of our 1D random walk. For a d dimensional random walk, the displacement is a combination of 2D degrees of freedom, each binomially distributed. It can be verified that the Variance in the displacement is proportional to the number of degrees of freedom squared.

The motion we have just analyzed is called a Simple Random Walk. It is simple in the sense that the random walker makes discrete fixed movements of  constant lengths at specified intervals.

The Continuous Time limit

A Diffusion process or Brownian motion can be modeled by a random walk with [Graphics:Images/randomwalk_gr_13.gif] in the continuous limit. Here no matter how small the time interval [Graphics:Images/randomwalk_gr_14.gif], the walker makes a random movement [Graphics:Images/randomwalk_gr_15.gif](t). On average this movement will be zero due to [Graphics:Images/randomwalk_gr_16.gif]. However the important property that the variance of a random walk scales linearly with time gives  [Graphics:Images/randomwalk_gr_17.gif]. This is also known as a Wiener process.

To see this lets assume that our walker takes steps of length r between each time interval of duration t. Since [Graphics:Images/randomwalk_gr_18.gif] his expected position at the next time step is his current position (see Martingale property) and the variance of his displacement is  [Graphics:Images/randomwalk_gr_19.gif]. To go to the continuous time limit we split the time interval t into n subintervals of duration [Graphics:Images/randomwalk_gr_20.gif] and between each subinterval we allow for the walker to take steps of [Graphics:Images/randomwalk_gr_21.gif] with equal likelihood. After a time t the position of the walker is found by summing the n independent, identical random variables Z. According to the Central Limit Theorem as n gets large the probability distribution  of the particles' position will begin to resemble a Gaussian distribution with zero mean and variance [Graphics:Images/randomwalk_gr_22.gif].

[Graphics:Images/randomwalk_gr_23.gif]

To prevent the walker from having an infinite or a zero variance as n goes to infinity our only possible choice for r' which also preserves the characteristics of our original random walker is to set

[Graphics:Images/randomwalk_gr_24.gif]

Hence if time gets rescaled by factor n then the space is rescaled by [Graphics:Images/randomwalk_gr_25.gif] and this preserves the physical properties of walker.

The continuos probability distribution p(x,t) of being at position x at time t, given that  [Graphics:Images/randomwalk_gr_26.gif]=1 evolves according to an parabolic partial differential equation called the Fokker-Planck equation (article to follow). However, since [Graphics:Images/randomwalk_gr_27.gif] there is no drift term and this equation reduces to the Diffusion equation:

[Graphics:Images/randomwalk_gr_28.gif]

where D is called the diffusion constant and is given by:

[Graphics:Images/randomwalk_gr_29.gif]

Finally, other stochastic processes whereby [Graphics:Images/randomwalk_gr_30.gif]exist. These are called subdiffusive if m>2, and superdiffusive if m<2 (article to follow).

 

Written by Raffaello Vardavas.

Back for more

Copyright © 2001-04 Quantnotes.com. All rights reserved. Legal Notice | Privacy Notice