<?xml version="1.0" encoding="iso-8859-1" ?> 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN" 
"http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd" > 
<?xml-stylesheet type="text/css" href="introdiffusion.css"?> 
<html  
xmlns="http://www.w3.org/1999/xhtml"  
><head><title></title> 
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" /> 
<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)" /> 
<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)" /> 
<!-- xhtml,mozilla --> 
<meta name="src" content="introdiffusion.tex" /> 
<meta name="date" content="2010-11-01 05:57:00" /> 
<link rel="stylesheet" type="text/css" href="introdiffusion.css" /> 
</head><body 
>
<!--l. 8--><p class="noindent" >Steven R. Dunbar <br 
class="newline" />Department of Mathematics <br 
class="newline" />203 Avery Hall <br 
class="newline" />University of Nebraska-Lincoln <br 
class="newline" />Lincoln, NE 68588-0130 <br 
class="newline" /><span 
class="cmtt-12">http://www.math.unl.edu </span><br 
class="newline" />Voice: 402-472-3731 <br 
class="newline" />Fax: 402-472-8466                  </p>
<div class="center" 
>
<!--l. 1--><p class="noindent" >
</p><!--l. 7--><p class="noindent" > <span 
class="cmbx-12x-x-144">Math 489/Math 889</span><br />
<span 
class="cmbx-12x-x-144">Stochastic Processes and</span><br />
<span 
class="cmbx-12x-x-144">Advanced Mathematical Finance</span><br />
<span 
class="cmbx-12x-x-144">Dunbar, Fall 2010</span>
</p></div>
<!--l. 19--><p class="noindent" >__________________________________________________________________________
</p>
<div class="center" 
>
<!--l. 21--><p class="noindent" >
</p><!--l. 21--><p class="noindent" ><span 
class="cmr-17">Intuitive Introduction to Diffusions</span></p></div>
<!--l. 23--><p class="indent" >   _______________________________________________________________________
</p><!--l. 1--><p class="indent" >   Note: To read these pages properly, you will need the latest version of the
Mozilla Firefox browser, with the STIX fonts installed. In a few sections, you will
also need the latest Java plug-in, and JavaScript must be enabled. If you use a
browser other than Firefox, you should be able to access the pages and run the
applets. However, mathematical expressions will probably not display
correctly. Firefox is currently the only browser that supports all of the open
standards.
</p><!--l. 27--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/rating.png" alt="Rating"  
 />
                                                                          

                                                                          
</p>
   <h3 class="likesectionHead"><a 
 id="x1-1000"></a>Rating</h3>
<!--l. 31--><p class="noindent" >Mathematically Mature: may contain mathematics beyond calculus with
proofs.
</p><!--l. 34--><p class="indent" >   _______________________________________________________________________________________________
</p><!--l. 36--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/question_mark.jpeg" alt="QuestionofDay"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-2000"></a>Question of the Day</h3>
<!--l. 39--><p class="noindent" >Suppose you wanted to display the function
<!--l. 39--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>y</mi> <mo 
class="MathClass-rel">=</mo> <msqrt><mrow><mi 
>x</mi></mrow></msqrt></mrow></math> on a
graphing calculator. Describe the process necessary to choose a proper window to
display the graph.
</p><!--l. 43--><p class="indent" >   _______________________________________________________________________________________________
</p><!--l. 45--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/keyconcepts.jpeg" alt="Key Concepts"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-3000"></a>Key Concepts</h3>
<!--l. 48--><p class="noindent" >
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-3002x1">The  passage  from  discrete  random  walks  to  continuous  stochastic
      processes, from the probability point of view and the partial differential
      equation point of view.</li></ol>
<!--l. 55--><p class="noindent" >__________________________________________________________________________
</p><!--l. 57--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/vocabulary.jpeg" alt="Vocabulary"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-4000"></a>Vocabulary</h3>
<!--l. 59--><p class="noindent" >
                                                                          

                                                                          
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-4002x1">A <span 
class="cmbx-12">diffusion process</span>, or a <span 
class="cmbx-12">diffusion </span>for short, is a Markov process
      for which all sample functions are continuous. It is also a solution to a
      stochastic differential equation.</li></ol>
<!--l. 68--><p class="noindent" >__________________________________________________________________________
</p><!--l. 70--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/mathematicalideas.jpeg" alt="Mathematical Ideas"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-5000"></a>Mathematical Ideas</h3>
<!--l. 73--><p class="noindent" >The question is &#x201C;How should we set up the limiting process so that we can make a
continuous time limit of the discrete time random walk?&#x201D; First we consider a
discovery approach to this question by asking what should be the limiting process
which assures us that we can visualize the limiting process. Next we take a
probabilistic view using the Central Limit Theorem to justify the limiting
process to pass from a discrete probability distribution to a probability
density function. Finally, we consider the limiting process derived from
passing from the difference equation from first-step analysis to a differential
equation.
</p><!--l. 83--><p class="noindent" >
</p>
   <h4 class="likesubsectionHead"><a 
 id="x1-6000"></a>Visualizing Limits of Random Walks</h4>
<!--l. 85--><p class="noindent" >
</p>
   <h5 class="likesubsubsectionHead"><a 
 id="x1-7000"></a>The Random Walk</h5>
<!--l. 87--><p class="noindent" >Consider a random walk starting at the origin. The
<!--l. 89--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>th step takes the
walker to the position <!--l. 89--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-rel">&#x22EF;</mo> <mo 
class="MathClass-bin">+</mo> <msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></math>,
the sum of n independent, identically distributed Bernoulli random variables
<!--l. 91--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></math> assuming
the values <!--l. 91--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></math>,
                                                                          

                                                                          
and <!--l. 91--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></math> with
probabilities <!--l. 92--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi></mrow></math>
and <!--l. 92--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>q</mi></mrow></math>
respectively. Then recall that the mean of a sum of random variables is the sum of
the means:
</p>
   <div class="math-display"><!--l. 94--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                                       <mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mi 
>n</mi>
</mrow></math></div>
<!--l. 96--><p class="nopar" > and the variance of a sum of <span 
class="cmti-12">independent </span>random variables is the sum of the
variances:
</p>
   <div class="math-display"><!--l. 98--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                                        <mo class="qopname">Var</mo><!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>4</mn><mi 
>p</mi><mi 
>q</mi><mi 
>n</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 100--><p class="nopar" >
</p><!--l. 102--><p class="noindent" >
</p>
   <h5 class="likesubsubsectionHead"><a 
 id="x1-8000"></a>Trying to use the mean to derive the limit</h5>
                                                                          

                                                                          
<!--l. 104--><p class="noindent" >Now suppose we want to display a motion picture of the random walk moving left and right
along the <!--l. 105--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>x</mi></mrow></math>-axis.
This would be a motion picture of the &#x201C;phase space&#x201D; diagram of the random walk.
Suppose we want the motion picture to display 1 million steps and be a
reasonable length of time, say 1000 seconds, between 16 and 17 minutes.
This fixes the time scale at a rate of one step per millisecond. What
should be the window in the screen in order to get a good sense of the
random walk? For this question, we use a fixed unit of measurement, say
centimeters, for the width of the screen and the individual steps. Let
<!--l. 113--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi></mrow></math>
be the length of the steps. To find the window to display the
random walk on the axis, we then need to know the size of
<!--l. 115--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></math>.
Now
</p>
   <div class="math-display"><!--l. 117--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                                  <mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>n</mi>
</mrow></math></div>
<!--l. 119--><p class="nopar" > and
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 120--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                                <mo class="qopname">Var</mo><!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>4</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>p</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>q</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msup><mrow 
><mi 
>&#x03B4;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>n</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 122--><p class="nopar" > We want <!--l. 122--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>
to be large (about 1 million) and to see the walk on the screen we want the
expected end place to be comparable to the screen size, say 30 cm. That
is,
</p>
   <div class="math-display"><!--l. 125--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                        <mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">&#x2248;</mo> <mn>3</mn><mn>0</mn><!--mstyle 
class="text"--><mtext  >&#x00A0;cm</mtext><!--/mstyle-->
</mrow></math></div>
<!--l. 128--><p class="nopar" > so <!--l. 128--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi></mrow></math> must
be <!--l. 128--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>3</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mn>1</mn><msup><mrow 
><mn>0</mn></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>5</mn></mrow></msup 
><!--mstyle 
class="text"--><mtext  >&#x00A0;cm</mtext><!--/mstyle--> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>0</mn><mn>0</mn><mn>0</mn><mn>3</mn><!--mstyle 
class="text"--><mtext  >&#x00A0;mm</mtext><!--/mstyle--></mrow></math> to
get the end point on the screen. But then the movement of the walk measured by
the standard deviation
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 131--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                         <msqrt><mrow><mo class="qopname">Var</mo> <!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msub><mrow 
><mi 
>T</mi> </mrow><mrow 
><mi 
>n</mi> </mrow> </msub 
> </mrow></mfenced></mrow></msqrt> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt> <mo 
class="MathClass-rel">=</mo> <mn>3</mn> <mo 
class="MathClass-bin">&#x00D7;</mo> <mn>1</mn><msup><mrow 
><mn>0</mn></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>2</mn></mrow></msup 
><!--mstyle 
class="text"--><mtext  >&#x00A0;&#x00A0;&#x00A0;cm&#x00A0;</mtext><!--/mstyle-->
</mrow></math></div>
<!--l. 134--><p class="nopar" > will be so small as to be indistinguishable. We will not see any random
variations!
</p><!--l. 138--><p class="noindent" >
</p>
   <h5 class="likesubsubsectionHead"><a 
 id="x1-9000"></a>Trying to use the variance to derive the limit</h5>
<!--l. 140--><p class="noindent" >Let us turn the question around: We want to see the variations in many-step
random walks, so the standard deviations must be a reasonable fraction
<!--l. 142--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>D</mi></mrow></math> of the
screen size
</p>
   <div class="math-display"><!--l. 144--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                          <msqrt><mrow><mo class="qopname">Var</mo> <!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msub><mrow 
><mi 
>T</mi> </mrow><mrow 
><mi 
>n</mi> </mrow> </msub 
> </mrow></mfenced></mrow></msqrt> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt> <mo 
class="MathClass-rel">&#x2248;</mo> <mi 
>D</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mn>3</mn><mn>0</mn><!--mstyle 
class="text"--><mtext  >&#x00A0;&#x00A0;cm&#x00A0;</mtext><!--/mstyle--><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 147--><p class="nopar" > This is possible if <!--l. 147--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>D</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mn>3</mn> <mo 
class="MathClass-bin">&#x00D7;</mo> <mn>1</mn><msup><mrow 
><mn>0</mn></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>2</mn></mrow></msup 
><!--mstyle 
class="text"--><mtext  >&#x00A0;&#x00A0;&#x00A0;cm&#x00A0;</mtext><!--/mstyle--><mo 
class="MathClass-punc">.</mo></mrow></math>
We still want to be able to see the ending expected position which will
be
                                                                          

                                                                          
</p>
   <div class="math-display"><!--l. 150--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                 <mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>n</mi> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>D</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mn>3</mn> <mo 
class="MathClass-bin">&#x00D7;</mo> <mn>1</mn><msup><mrow 
><mn>0</mn></mrow><mrow 
><mn>4</mn></mrow></msup 
><!--mstyle 
class="text"--><mtext  >&#x00A0;cm</mtext><!--/mstyle--><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 153--><p class="nopar" > To be consistent with the variance requirement this will only be possible if
<!--l. 154--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2248;</mo> <mn>1</mn><msup><mrow 
><mn>0</mn></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>2</mn></mrow></msup 
></mrow></math>. That is,
<!--l. 154--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow></math> must be comparable
in magnitude to <!--l. 155--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">=</mo> <mn>3</mn> <mo 
class="MathClass-bin">&#x00D7;</mo> <mn>1</mn><msup><mrow 
><mn>0</mn></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>2</mn></mrow></msup 
></mrow></math>.
</p><!--l. 157--><p class="noindent" >
</p>
   <h5 class="likesubsubsectionHead"><a 
 id="x1-10000"></a>The limiting process</h5>
<!--l. 159--><p class="noindent" >Now generalize these results to visualize longer and longer walks in a fixed amount or
time. Since <!--l. 160--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mn>0</mn></mrow></math>
as <!--l. 160--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></math>, then
likewise <!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">&#x2192;</mo> <mn>0</mn></mrow></math>,
while <!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>q</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn></mrow></math>, so
<!--l. 161--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math>.
The analytical formulation of the problem is as follows. Let
<!--l. 162--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi></mrow></math> be the size of the
individual steps, let <!--l. 163--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>r</mi></mrow></math>
be the number of steps per unit time. We ask what happens to the random walk in the
limit where <!--l. 165--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mn>0</mn></mrow></math>,
<!--l. 165--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>r</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></math>, and
<!--l. 165--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math> in
such a manner that:
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 167--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                                       <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>r</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>c</mi>
</mrow></math></div>
<!--l. 169--><p class="nopar" > and
</p>
   <div class="math-display"><!--l. 170--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                                     <mn>4</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>p</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>q</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msup><mrow 
><mi 
>&#x03B4;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>r</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>D</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 172--><p class="nopar" >
</p><!--l. 175--><p class="noindent" >
</p>
   <h4 class="likesubsectionHead"><a 
 id="x1-11000"></a>Probabilistic Solution of the Limit Question</h4>
<!--l. 177--><p class="noindent" >In our accelerated random walk, consider the
<!--l. 177--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>th step at time
<!--l. 177--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>t</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>n</mi><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>r</mi></mrow></math> and consider the
position on the line <!--l. 178--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>x</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>k</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi></mrow></math>.
Let
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 180--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                                       <msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mi 
>k</mi></mrow></mfenced>
</mrow></math></div>
<!--l. 182--><p class="nopar" > be the probability that the <!--l. 182--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>th
step is at position <!--l. 182--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>k</mi></mrow></math>.
We are interested in the probability of finding the walk at given instant
<!--l. 183--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>t</mi></mrow></math> and in the neighborhood
of a given point <!--l. 184--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>x</mi></mrow></math>, so we
investigate the limit of <!--l. 185--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow></math>
as <!--l. 185--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>r</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>t</mi></mrow></math>,
and <!--l. 185--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>k</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x2192;</mo> <mi 
>x</mi></mrow></math>.
</p><!--l. 188--><p class="indent" >   Remember that the random walk can only reach an even-numbered
position after an even number of steps, and an odd-numbered
position after an odd number of steps. Therefore in all cases
<!--l. 190--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>k</mi></mrow></math> is even and
<!--l. 190--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math> is an integer.
Likewise <!--l. 191--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>k</mi></mrow></math> is even
and <!--l. 191--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math> is and integer.
We reach position <!--l. 192--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>k</mi></mrow></math>
at time step <!--l. 192--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math> if the
walker takes <!--l. 193--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math> steps
to the right and <!--l. 193--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math>
steps to the left. The mix of steps to the right and the left can be in any order. So the walk
reaches position <!--l. 195--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>k</mi></mrow></math>
at step <!--l. 195--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>
with binomial probability
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 197--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                           <msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><mfenced separators="" 
open="(" close=")"><mfrac linethickness="0.0pt"><mrow>       <mi 
>n</mi></mrow> 
<mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></mfrac></mfenced> <mo 
class="MathClass-bin">&#x22C5;</mo> <msup><mrow 
><mi 
>p</mi></mrow><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></msup 
> <mo 
class="MathClass-bin">&#x22C5;</mo> <msup><mrow 
><mi 
>q</mi></mrow><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></msup 
>
</mrow></math></div>
<!--l. 199--><p class="nopar" > From the Central Limit Theorem
</p><!--tex4ht:inline--><!--l. 207--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mtable 
columnalign="left" class="align-star">
     <mtr><mtd 
columnalign="right" class="align-odd"><msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mtd>     <mtd 
class="align-even"> <mo 
class="MathClass-rel">&#x223C;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03C0;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>p</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>q</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">[</mo><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>k</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>n</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>p</mi></mrow><mo 
class="MathClass-close">]</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03C0;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>n</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>p</mi><mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace width="2em"/></mtd>     <mtd 
columnalign="right" class="align-label"></mtd>     <mtd 
class="align-label">
     <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>        <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>p</mi><mi 
>q</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">[</mo><mrow><mi 
>k</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>n</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">]</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>8</mn><mi 
>&#x03C0;</mi><mi 
>n</mi><mi 
>p</mi><mi 
>q</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace width="2em"/></mtd>                 <mtd 
columnalign="right" class="align-label"></mtd>     <mtd 
class="align-label">
     <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>        <mtd 
class="align-even"> <mo 
class="MathClass-rel">&#x223C;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>&#x03B4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi><mi 
>D</mi><mi 
>t</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">[</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">]</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>D</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mspace width="2em"/></mtd>                         <mtd 
columnalign="right" class="align-label"></mtd>     <mtd 
class="align-label">
     <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>        <mtd 
class="align-even"><mspace width="2em"/></mtd>                                                                  <mtd 
columnalign="right" class="align-label">
   </mtd></mtr></mtable></math>
<!--l. 209--><p class="noindent" >Since <!--l. 209--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow></math> is the
probability of finding <!--l. 209--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi></mrow></math>
between <!--l. 210--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>k</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi></mrow></math> and
<!--l. 210--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>k</mi> <mo 
class="MathClass-bin">+</mo> <mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi></mrow></math>, and since this interval
has length <!--l. 211--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi></mrow></math> we can
say that the ratio <!--l. 211--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>&#x03B4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>
measures locally the probability per unit length, that is the
probability density. The last relation above implies that the ratio
                                                                          

                                                                          
<!--l. 214--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>n</mi></mrow></math> tends
to
</p>
   <div class="math-display"><!--l. 215--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                <mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03C0;</mi><mi 
>D</mi><mi 
>t</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">[</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">]</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>D</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow>
</mrow></math></div>
<!--l. 218--><p class="nopar" >
</p><!--l. 221--><p class="indent" >   It follows by the definition of integration as the sums of quantities
representing densities times geometric lengths or areas, that sums of probabilities
<!--l. 223--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow></math> can
be approximated by integrals and the result may be restated as
</p>
   <div class="math-display"><!--l. 225--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
            <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>a</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mi 
>b</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x2192;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi><mi 
>D</mi><mi 
>t</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><msubsup><mrow 
><mo 
class="MathClass-op"> &#x222B;
 <!--nolimits--></mo><!--nolimits--></mrow><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>b</mi></mrow></msubsup 
><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>D</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow>
</mrow></math></div>
<!--l. 228--><p class="nopar" > The integral on the right may be expressed in terms of the standard normal
distribution function.
</p><!--l. 231--><p class="indent" >   Note that we derived the limiting approximation of the binomial distribution
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 233--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x223C;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>&#x03B4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi><mi 
>D</mi><mi 
>t</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">[</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">]</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>D</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow>
</mrow></math></div>
<!--l. 236--><p class="nopar" > by applying the general form of the Central Limit Theorem. However, it is
possible to derive this limit directly through careful analysis. The direct derivation
is known as the DeMoivre-Laplace Theorem and it is the most basic form of the
Central Limit Theorem.
</p><!--l. 242--><p class="noindent" >
</p>
   <h4 class="likesubsectionHead"><a 
 id="x1-12000"></a>Differential Equation Solution of the Limit Question</h4>
<!--l. 244--><p class="noindent" >Another method is to start from the difference equations governing the random
walk, and then pass to the differential equation in the limit. We can then
obviously generalize the differential equations, and find out that the differential
equations govern well-defined stochastic processes depending on continuous time.
Since differential equations have a well-developed theory and many tools
to manipulate, transform and solve them, this method turns out to be
useful.
</p><!--l. 252--><p class="indent" >   Consider the position of the walker in the random walk at the
<!--l. 252--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>th
and <!--l. 253--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>st
trial. Through a first step analysis the probabilities
<!--l. 254--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow></math>
satisfy the difference equations:
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 255--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                               <msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mi 
>p</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">+</mo> <mi 
>q</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
>
</mrow></math></div>
<!--l. 257--><p class="nopar" > In the limit as <!--l. 257--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>k</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></math>
and <!--l. 257--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></math>,
<!--l. 257--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
></mrow></math> will be the sampling
of the function <!--l. 258--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math> at
time intervals <!--l. 258--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>r</mi></mrow></math>, so
that <!--l. 259--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>k</mi><mi 
>r</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>t</mi></mrow></math>, and space
intervals so that <!--l. 259--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>x</mi></mrow></math>.
That is, the function <!--l. 260--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>
should be an approximate solution of the difference equation:
</p>
   <div class="math-display"><!--l. 262--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                       <mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi> <mo 
class="MathClass-bin">+</mo> <msup><mrow 
><mi 
>r</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></msup 
><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>p</mi><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03B4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">+</mo> <mi 
>q</mi><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>&#x03B4;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow>
</mrow></math></div>
<!--l. 264--><p class="nopar" > We assume <!--l. 264--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>
is a smooth function so that we can expand
<!--l. 264--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>
in a Taylor series at any point. Using the first order approximation in
the time variable on the left, and the second-order approximation on
                                                                          

                                                                          
the right in the space variable, we get (after canceling the leading terms
<!--l. 268--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>
)
</p>
   <div class="math-display"><!--l. 269--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                  <mfrac><mrow 
><mi 
>&#x2202;</mi><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
   <mrow 
><mi 
>&#x2202;</mi><mi 
>t</mi></mrow></mfrac>    <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>q</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>&#x03B4;</mi><mi 
>r</mi><mfrac><mrow 
><mi 
>&#x2202;</mi><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
   <mrow 
><mi 
>&#x2202;</mi><mi 
>x</mi></mrow></mfrac>    <mo 
class="MathClass-bin">+</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><msup><mrow 
><mi 
>&#x03B4;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mi 
>r</mi><mfrac><mrow 
><msup><mrow 
><mi 
>&#x2202;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
   <mrow 
><mi 
>&#x2202;</mi><msup><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow></mfrac>
</mrow></math></div>
<!--l. 273--><p class="nopar" > In our passage to the limit, the omitted terms of higher order tend to zero, so
may be neglected. The remaining coefficients are already accounted for in our
limits and so the equation becomes:
</p>
   <div class="math-display"><!--l. 276--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                       <mfrac><mrow 
><mi 
>&#x2202;</mi><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
   <mrow 
><mi 
>&#x2202;</mi><mi 
>t</mi></mrow></mfrac>    <mo 
class="MathClass-rel">=</mo> <mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mfrac><mrow 
><mi 
>&#x2202;</mi><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
   <mrow 
><mi 
>&#x2202;</mi><mi 
>x</mi></mrow></mfrac>    <mo 
class="MathClass-bin">+</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mi 
>D</mi><mfrac><mrow 
><msup><mrow 
><mi 
>&#x2202;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
   <mrow 
><mi 
>&#x2202;</mi><msup><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow></mfrac>
</mrow></math></div>
<!--l. 279--><p class="nopar" > This is a special <span 
class="cmti-12">diffusion equation</span>, more specifically, a diffusion equation with
convective or drift terms, also known as the Fokker-Planck equation for
diffusion. It is a standard problem to solve the differential equation for
<!--l. 284--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math> and
therefore, we can find the probability of being at a certain position at a certain
time. One can verify that
                                                                          

                                                                          
</p>
   <div class="math-display"><!--l. 287--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                    <mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi><mi 
>D</mi><mi 
>t</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">[</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">]</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>D</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow>
</mrow></math></div>
<!--l. 289--><p class="nopar" > is a solution of the diffusion equation, so we reach the same probability distribution
for <!--l. 290--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>.
</p><!--l. 292--><p class="indent" >   The diffusion equation can be immediately generalized by permitting the coefficients
<!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>c</mi></mrow></math> and
<!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>D</mi></mrow></math> to depend
on <!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>x</mi></mrow></math>,
and <!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>t</mi></mrow></math>.
Furthermore, the equation possesses obvious analogues in higher dimensions and
all these generalization can be derived from general probabilistic postulates. We
will ultimately describe stochastic processes related to these equations as
<span 
class="cmti-12">diffusions</span>.
</p><!--l. 300--><p class="noindent" >
</p>
   <h4 class="likesubsectionHead"><a 
 id="x1-13000"></a>Sources</h4>
<!--l. 302--><p class="noindent" >This section is adapted from W. Feller, in <span 
class="cmti-12">Introduction to Probability Theory and</span>
<span 
class="cmti-12">Applications, Volume I</span>, Chapter XIV, page 354.
</p><!--l. 308--><p class="indent" >   _______________________________________________________________________________________________
</p><!--l. 310--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/solveproblems.jpeg" alt="Problems to Work"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-14000"></a>Problems to Work for Understanding</h3>
                                                                          

                                                                          
<!--l. 312--><p class="noindent" >
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-14002x1">Consider a random walk with a step to right having probability <!--l. 314--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi></mrow></math>
      and a step to the left having probability <!--l. 315--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>q</mi></mrow></math>.
      The step length is <!--l. 316--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03B4;</mi></mrow></math>.
      The walk is taking <!--l. 316--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>r</mi></mrow></math>
      steps per minute. What is the rate of change of the expected final
      position and the rate of change of the variance? What must we require
      on the quantities <!--l. 319--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi></mrow></math>,
      <!--l. 319--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>q</mi></mrow></math>,
      <!--l. 319--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>r</mi></mrow></math>
      and <!--l. 319--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>d</mi><mi 
>e</mi><mi 
>l</mi><mi 
>t</mi><mi 
>a</mi></mrow></math>
      in order to see the entire random walk with more and more steps at a
      fixed size in a fixed amount of time?
      </li>
      <li 
  class="enumerate" id="x1-14004x2">Verify the limit taking to show that
<div class="math-display"><!--l. 324--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                <msub><mrow 
><mi 
>v</mi></mrow><mrow 
><mi 
>k</mi><mo 
class="MathClass-punc">,</mo><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x223C;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi><mi 
>D</mi><mi 
>t</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">[</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">]</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>D</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
      <!--l. 327--><p class="nopar" >
      </p></li>
      <li 
  class="enumerate" id="x1-14006x3">Show that
                                                                          

                                                                          
<div class="math-display"><!--l. 330--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
               <mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi><mi 
>D</mi><mi 
>t</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mrow ><mo 
class="MathClass-open">[</mo><mrow><mi 
>x</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>c</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">]</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><mi 
>D</mi><mi 
>t</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow>
</mrow></math></div>
      <!--l. 332--><p class="nopar" > is a solution of
</p>
<div class="math-display"><!--l. 333--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                  <mfrac><mrow 
><mi 
>&#x2202;</mi><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
   <mrow 
><mi 
>&#x2202;</mi><mi 
>t</mi></mrow></mfrac>   <mo 
class="MathClass-rel">=</mo> <mo 
class="MathClass-bin">&#x2212;</mo><mi 
>c</mi><mfrac><mrow 
><mi 
>&#x2202;</mi><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow>
   <mrow 
><mi 
>&#x2202;</mi><mi 
>x</mi></mrow></mfrac>    <mo 
class="MathClass-bin">+</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mi 
>D</mi><mfrac><mrow 
><msup><mrow 
><mi 
>&#x2202;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mi 
>v</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>t</mi><mo 
class="MathClass-punc">,</mo><mi 
>x</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow> 
   <mrow 
><mi 
>&#x2202;</mi><msup><mrow 
><mi 
>x</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow></mfrac>
</mrow></math></div>
      <!--l. 336--><p class="nopar" > by substitution.</p></li></ol>
<!--l. 339--><p class="noindent" >__________________________________________________________________________
</p><!--l. 341--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/books.jpeg" alt="Books"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-15000"></a>Reading Suggestion:</h3>
                                                                          

                                                                          
<!--l. 1--><p class="noindent" >
</p>
   <h3 class="likesectionHead"><a 
 id="x1-16000"></a>References</h3>
<!--l. 1--><p class="noindent" >
   </p><div class="thebibliography">
   <p class="bibitem" ><span class="biblabel">
 [1]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
 id="Xfeller73"></a>William  Feller.    <span 
class="cmti-12">An  Introduction  to  Probability  Theory  and  Its</span>
   <span 
class="cmti-12">Applications, Volume I, Third Edition</span>, volume&#x00A0;I. John Wiley and Sons,
   third edition edition, 1973. QA 273 F3712.
   </p>
   <p class="bibitem" ><span class="biblabel">
 [2]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
 id="Xlesigne05"></a>Emmanuel  Lesigne.    <span 
class="cmti-12">Heads  or  Tails:  An  Introduction  to  Limit</span>
   <span 
class="cmti-12">Theorems in Probability</span>,  volume&#x00A0;28  of  <span 
class="cmti-12">Student Mathematical Library</span>.
   American Mathematical Society, 2005.
</p>
   </div>
<!--l. 358--><p class="noindent" >__________________________________________________________________________
</p><!--l. 360--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/chainlink.png" alt="Links"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-17000"></a>Outside Readings and Links:</h3>
<!--l. 362--><p class="noindent" >
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-17002x1"><a 
href="http://www.youtube.com/watch?v=PtYP8uoN0lk" >Brownian Motion in Biology</a>.. A simulation of a random walk of a sugar
      molecule in a cell.
      </li>
      <li 
  class="enumerate" id="x1-17004x2"><a 
href="http://www.math.uah.edu/stat/sample/Walk.xhtml" >Virtual Laboratories in Probability and Statistics</a>.. Search the page for
      Random Walk experiment.</li></ol>
<!--l. 373--><p class="noindent" >__________________________________________________________________________
                                                                          

                                                                          
</p><!--l. 3--><p class="indent" >   <span 
class="cmr-10x-x-109">I check all the information on each page for correctness and typographical errors.</span>
<span 
class="cmr-10x-x-109">Nevertheless, some errors may occur and I would be grateful if you would alert me to</span>
<span 
class="cmr-10x-x-109">such errors. I make every reasonable effort to present current and accurate information</span>
<span 
class="cmr-10x-x-109">for public use, however I do not guarantee the accuracy or timeliness of information on</span>
<span 
class="cmr-10x-x-109">this website. Your use of the information from this website is strictly voluntary and at</span>
<span 
class="cmr-10x-x-109">your risk.</span>
</p><!--l. 12--><p class="indent" >   <span 
class="cmr-10x-x-109">I have checked the links to external sites for usefulness. Links to external websites</span>
<span 
class="cmr-10x-x-109">are provided as a convenience. I do not endorse, control, monitor, or guarantee the</span>
<span 
class="cmr-10x-x-109">information contained in any external website. I don&#x2019;t guarantee that the links are</span>
<span 
class="cmr-10x-x-109">active at all times. Use the links here with the same caution as you would all</span>
<span 
class="cmr-10x-x-109">information on the Internet. This website reflects the thoughts, interests and opinions of</span>
<span 
class="cmr-10x-x-109">its author. They do not explicitly represent official positions or policies of my</span>
<span 
class="cmr-10x-x-109">employer.</span>
</p><!--l. 22--><p class="indent" >   <span 
class="cmr-10x-x-109">Information on this website is subject to change without notice.</span>
</p><!--l. 2--><p class="indent" >   Steve Dunbar&#x2019;s Home Page, <span class="obeylines-h"><span class="verb"><span 
class="cmtt-12">http://www.math.unl.edu/~sdunbar1</span></span></span>
</p><!--l. 4--><p class="indent" >   Email to Steve Dunbar, <span class="obeylines-h"><span class="verb"><span 
class="cmtt-12">sdunbar1</span><span 
class="cmtt-12">&#x00A0;at</span><span 
class="cmtt-12">&#x00A0;unl</span><span 
class="cmtt-12">&#x00A0;dot</span><span 
class="cmtt-12">&#x00A0;edu</span></span></span>
</p><!--l. 377--><p class="indent" >   Last modified: Processed from <span class="LATEX">L<span class="A">A</span><span class="TEX">T<span 
class="E">E</span>X</span></span>&#x00A0;source on November 1, 2010
</p>
    
</body> 
</html> 

                                                                          



