Autocorrelation function of a Wiener process & Poisson process

JohanL
Messages
154
Reaction score
0

Homework Statement



3. The Attempt at a Solution [/B]

lsvdV.jpg


*****************************************

Can anyone possibly explain step 3 and 4 in this solution?
 
Physics news on Phys.org
Step 3 looks like an application of the Tower Law or 'Law of Total Expectation' (see link). It's a very useful law and well worth spending the time to familiarise yourself with it!
The fourth step is just an application of the given autocorrelation function to the expression inside the outer expectation.
 
  • Like
Likes JohanL
JohanL said:

Homework Statement



3. The Attempt at a Solution [/B]

lsvdV.jpg


*****************************************

Can anyone possibly explain step 3 and 4 in this solution?

Sometimes (at least when one is starting out) it is better to be less abstract and more explicit. So, let's be explicit.

Assume ##s < t##, so ##N(t) \geq N(s)## (because of the possible arrivals between ##s## and ##t##). Thus
\begin{array}{rcl}R_X(s,t) &amp;= &amp; \sum_{j=0}^{\infty} \sum_{k=0}^{\infty} P(N(s)=j, N(t) = j+k) E[W(j) W(j+k)] \\<br /> &amp;= &amp;\sigma^2 \sum_j \sum_k P(N(s)=j) P(N(t) = j+k|N(s)=j) \min(j,j+k)<br /> \end{array}<br />
Of course, ##\min(j,j+k) = j## and we also have ##P(N(t) = j+k | N(s) = j) = P(N(t-s) = k)##, by stationarity and independent increments of the Poisson process. Now the rest is easy.

Of course, if ##t < s## we can just interchange the roles of ##s## and ##t## in the argument.
 
  • Like
Likes JohanL
Ray Vickson said:
Sometimes (at least when one is starting out) it is better to be less abstract and more explicit. So, let's be explicit.

Assume ##s < t##, so ##N(t) \geq N(s)## (because of the possible arrivals between ##s## and ##t##). Thus
\begin{array}{rcl}R_X(s,t) &amp;= &amp; \sum_{j=0}^{\infty} \sum_{k=0}^{\infty} P(N(s)=j, N(t) = j+k) E[W(j) W(j+k)] \\<br /> &amp;= &amp;\sigma^2 \sum_j \sum_k P(N(s)=j) P(N(t) = j+k|N(s)=j) \min(j,j+k)<br /> \end{array}<br />
Of course, ##\min(j,j+k) = j## and we also have ##P(N(t) = j+k | N(s) = j) = P(N(t-s) = k)##, by stationarity and independent increments of the Poisson process. Now the rest is easy.

Of course, if ##t < s## we can just interchange the roles of ##s## and ##t## in the argument.

andrewkirk said:
Step 3 looks like an application of the Tower Law or 'Law of Total Expectation' (see link). It's a very useful law and well worth spending the time to familiarise yourself with it!
The fourth step is just an application of the given autocorrelation function to the expression inside the outer expectation.

I had only seen the tower law used in connection with martingales, and defined in connection with martingales, and the law of total expectation have i ofc used but only in what they call the special case on the wiki-page. Did not know it was a more general case. Ty!
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top