The Student Room Group

Renewal process, generating function question



I'm on 3b(i).

I have no idea where to begin.

GXt=E(SXt)G_{X_t} = E(S^{X_t})

I'm sure this has something to do with the fact that the interrarival times of a Poisson process are exponentially distributed but I can't see the link.

Part (ii) is fine, and part 3 is really simple, lol.

Part (c) is also a problem. Can someone guide me in the right direction?
(edited 12 years ago)
Reply 1
for 3bi, X_t has poisson distribution with parameter lambda*t so you can use the pmf of a poisson distribution to get P(X_t=k).

Then, E(sXt)=k=0skP(Xt=k)E(s^{X_t})=\sum_{k=0}^\infty s^kP(X_t=k) so you can try and get this into the form of a power series expansion for 'e to the power of something'.
Original post by ttoby
for 3bi, X_t has poisson distribution with parameter lambda*t so you can use the pmf of a poisson distribution to get P(X_t=k).

Then, E(sXt)=k=0skP(Xt=k)E(s^{X_t})=\sum_{k=0}^\infty s^kP(X_t=k) so you can try and get this into the form of a power series expansion for 'e to the power of something'.


Okay, that makes a lot of sense. I think I just confused interarrival times with just the number of arrivals.

For part (c), I'm not sure what's going on.

(c) (i): If the number of arrivals XtX_t is even, then I understand that we have one renewal every two arrivals, so therefore Nt=12XtN_t = \frac{1}{2}X_t.

Now if XtX_t is odd, then since every second arrival is a renewal and our counting process for XtX_t starts from 1, then we have 2, 4, 6... counting towards the renewal and if we land on say, 7, then we have Nt=62=712=Xt12N_t = \frac{6}{2} = \frac{7-1}{2} = \frac{X_t - 1}{2}.

Is this a sufficient explanation?

For (ii), I got:

m(t)=E(Nt)=12E(Xt)P(Xt Even)+12E(Xt1)P(Xt odd)m(t) = E(N_t) = \frac{1}{2}E(X_t)P(X_t \ Even) + \frac{1}{2}E(X_t - 1)P(X_t \ odd)

so

m(t)=12E(Xt)P(Xt Even)+12E(Xt)P(Xt odd)12P(Xt odd)m(t) = \frac{1}{2}E(X_t)P(X_t \ Even) + \frac{1}{2}E(X_t)P(X_t \ odd) - \frac{1}{2}P(X_t \ odd)
=12E(Xt)[P(Xt even)+P(Xt Odd)]12P(Xt odd)= \frac{1}{2} E(X_t) [P(X_t \ even) + P(X_t \ Odd)] - \frac{1}{2} P(X_t \ odd)

And since P(Even)+P(odd) = 1, I get something close but not quite what I need. What am I doing wrong?

Edit: This does however give me exactly what I need for the last part. Perhaps it's an error?
(edited 12 years ago)
Reply 3
Original post by wanderlust.xx
Okay, that makes a lot of sense. I think I just confused interarrival times with just the number of arrivals.

For part (c), I'm not sure what's going on.

(c) (i): If the number of arrivals XtX_t is even, then I understand that we have one renewal every two arrivals, so therefore Nt=12XtN_t = \frac{1}{2}X_t.

Now if XtX_t is odd, then since every second arrival is a renewal and our counting process for XtX_t starts from 1, then we have 2, 4, 6... counting towards the renewal and if we land on say, 7, then we have Nt=62=712=Xt12N_t = \frac{6}{2} = \frac{7-1}{2} = \frac{X_t - 1}{2}.

Is this a sufficient explanation?

For (ii), I got:

m(t)=E(Nt)=12E(Xt)P(Xt Even)+12E(Xt1)P(Xt odd)m(t) = E(N_t) = \frac{1}{2}E(X_t)P(X_t \ Even) + \frac{1}{2}E(X_t - 1)P(X_t \ odd)

so

m(t)=12E(Xt)P(Xt Even)+12E(Xt)P(Xt odd)12P(Xt odd)m(t) = \frac{1}{2}E(X_t)P(X_t \ Even) + \frac{1}{2}E(X_t)P(X_t \ odd) - \frac{1}{2}P(X_t \ odd)
=12E(Xt)[P(Xt even)+P(Xt Odd)]12P(Xt odd)= \frac{1}{2} E(X_t) [P(X_t \ even) + P(X_t \ Odd)] - \frac{1}{2} P(X_t \ odd)

And since P(Even)+P(odd) = 1, I get something close but not quite what I need. What am I doing wrong?

Edit: This does however give me exactly what I need for the last part. Perhaps it's an error?


For part i, you need to show it in general because if you just give an example then they could say 'well you showed it for 7 but that doesn't necessarily mean it's true for every other odd number' and dock marks. What you could try is an arguement along the lines of 'if Xt=2nX_t=2n then arrivals 2, 4, 6, 8, ..., 2n are counted and there are n=Xt/2n=X_t/2 of these' then something similar for odd numbers.

For ii, I haven't seen the term 'renewal function' before, but assuming you're correct when you say m(t)=E(Nt)m(t) = E(N_t) then the rest of your workings do follow so perhaps it's just a typo there.
Original post by ttoby
For part i, you need to show it in general because if you just give an example then they could say 'well you showed it for 7 but that doesn't necessarily mean it's true for every other odd number' and dock marks. What you could try is an arguement along the lines of 'if Xt=2nX_t=2n then arrivals 2, 4, 6, 8, ..., 2n are counted and there are n=Xt/2n=X_t/2 of these' then something similar for odd numbers.

For ii, I haven't seen the term 'renewal function' before, but assuming you're correct when you say m(t)=E(Nt)m(t) = E(N_t) then the rest of your workings do follow so perhaps it's just a typo there.


Yeah it's definitely a typo, I double checked - turns out they don't update papers.

And yeah, I did generalise the case when I wrote it down. Thanks for that. :smile:

Quick Reply

Latest