1
$\begingroup$

I got some problems with this homework which I have totally no idea, never got into this field before and I really need some help.

First, we have a wiener process like

enter image description here

Which means the probability of the process drops beneath -3 within the time interval [0,1].

Now the thing is we have to simulate the process by discretize it.

1.Suppose we first discretize the process by 100 points and simulate 10,000 process in this way.

i.e., W(0.01), W(0.02), …., W(1.00).

Note that W(t) – W(t-0.01) ~ N(0,0.01) independently.

2.Using the data obtained at 1., we approximate

enter image description here

by

enter image description here

what is the relationship between this value and the real

enter image description here

(larger, equal to or smaller)?

3.Repeat 1. and 2. by cutting [0,1] into 10,000 points instead. Will the resulting probability increases or decreases?

$\endgroup$
2
  • $\begingroup$ the only thing i know about is I can simulate wiener process by using BM function in Sim.DiffProc package.. that s all. I am so new that I dnt even know how to simulate a wiener process which has a min limit...guys plz help me orz $\endgroup$
    – recon
    Commented May 5, 2019 at 1:01
  • $\begingroup$ in R: n <- 1000; mean(sapply(1:10000, function(unused_arg) min(cumsum(rnorm(n, 0, 1/n))) < -3)) $\endgroup$
    – Taylor
    Commented May 5, 2019 at 14:53

1 Answer 1

3
$\begingroup$

Hi: What you said about the normal and the brownian motion is correct. So, for the case of 100 points and 1 simulation you can do the following steps.

A) generate 100 normal random variables N(0,s) with s = 0.01. Then label them $X_{1}, X_{2}, \ldots X_{100}$

The key thing to understand here is that, at any time say $t = k$, the sum of any of these $k$ normals is N(0, k \times .01). More importantly, this sum is a discrete approximation to the true brownian motion process $W(t = .01 \times k)$ where time is continuous. This is the most important part to understand. The proof of this is probably in most advanced stochastic processes texts but I think your professor wants you to accept this as given, atleast for now.

So, when you simulate those normal random variables, then, if you add them up, you are simulating an brownian motion approximately, since, by definition

$W(.01) \sim X_{1}$,

$W(.02) \sim X_{1} + X_{2}$

$W(.03) \sim X_{1} + X_{2} + X_{3}$

$W(.01 \times k ) \sim X_{1} + X_{2} + \ldots X_{k}$

and so on and so forth.

So, the values of $W(.01 \times k)$ for any $k = 1 \ldots 100 $ gives you the location of your simulated ( approximate ) brownian process $W(.01 \times k )$ at time .01 * k. So, what you have done up to now is generate an approximation to the true brownian motion process, W(t), one time. Any value of $W(.01 *k)$ tells you where the approximated process, $W(t)$ is ( the value of the process if you want to think of it that way. Personally, I think location gives you a better idea of what's going on ) at time $t = .01 \times k$. So, you need to keep in mind that what was generated with the 100 normals is only an approximation to the true $W(t)$ process where $t$ is continuous.

B) Take your $W(.01 * k)$ process and check if any of the locations ( values, if you will ) of the process are less than -3.

C) If any of them are, then , for this first simulation, the event min over all $k$ $W(.01 * k) < -3$ happened so set $success_1 = 1$ for. Otherwise, set $success_1 = 0$.

END OF STEPS.

Next, Do STEPS A-C, 10000 times ( 10000 simulations ) and count up the $success_i$ from $i = 1 \ldots 10,000$ and call the sum, sum_success.

Then, the estimate of the probability of the event min over $k$ W(.01 * k) < - 3, is the proportion of the 10,000 times that $success_i$ was 1 so the estimate of the probability is sum_success divided by 10,000.

For the second part, if you split time into 10,000 points rather than 100 points ( for any one simulation ), the approximation to the true brownian motion process $W(t)$ becomes better and better because you are making the time step (in the 10,000 case it's .0001 ) smaller and smaller.

What using 10,000 points rather than 100 points does to the probability estimate is an exercise for the reader !!!!!! Your estimate in the 10,000 split case compared to the 100 split case should tell you what happens.

James Hamilton's "Time Series Analysis" has a really nice section on the approximation to brownian motion through the use of normals. It does a way better job than I've done here so I highly recommend it. There are probably many other nice explanations in other places but that's the one I always go back to.

.
$\endgroup$
5
  • $\begingroup$ Thank you so much! (so frustrated taking a stat department course...barely know anything lol, anyway thanks again! you make this much more ezier!) $\endgroup$
    – recon
    Commented May 5, 2019 at 11:48
  • $\begingroup$ I really want to upvote your answer but sadly I dnt even have 15 points to do that :( $\endgroup$
    – recon
    Commented May 5, 2019 at 11:49
  • $\begingroup$ don't worry about upvote. I'm. glad to help. If you take a math-stat class or a stochastic processes class first, all of this will be more easily understood..sometimes difference in background makes things more difficult. try to check out Hamilton's text. It's mostly time-series but there's a small section on brownian motion derivation and it's not so difficult math-wise. $\endgroup$
    – mlofton
    Commented May 5, 2019 at 14:04
  • $\begingroup$ and thanks to whoever edited my answer. $\endgroup$
    – mlofton
    Commented May 5, 2019 at 14:07
  • $\begingroup$ UPDATE AND CORRECTION: Here is a correction for how I described the BM generation in the answer. Karl Sigman explains in his note that, once you generate the normally distributed $Z_i$, you add them up but you add them in a more complex way than I described. Otherwise, you won't obtain the properties of BM when you try to generate it. columbia.edu/~ks20/4404-Sigman/4404-Notes-sim-BM.pdf Apologies for correction. $\endgroup$
    – mlofton
    Commented Dec 9 at 11:40

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.