Renewal Process

This is a fundamental stochastic process useful in modelling arrivals and interarrival times. Some definitions will make the usage clear.

Let Si denote the ith renewal time or the time when the ith arrival takes place. By definition, S0=0. We can also define Sn=Sn1+ξnSn=ξ1+ξ2++ξn1 where ξi are positive (P(ξ>0)=1) independent identically distributed variables representing the interarrival times. We also define Nt=argmaxkSktSn>t=Nt<n or, Nt is simply the number of arrivals till the time t.

Define the following quantity Fn=FξFξ n timesu(t)=i=1Fn(t) It can be shown that the function u(t) converges. The expectation of Nt then becomes E[Nt]=E[number of n such that Snt]=E[n=1I(Snt)] sum of Indicators will equal n=n=1P(Snt) since E[Indicator] is just the function inside indicator=n=1Fn(t) by defining cumulative as sum of ξs=u(t)

Laplace Transform

For a density function f defined from R0R, Laplace transform is Lf(s)=R0esxf(x)dx The following properties hold for this transform

  1. If f is a probability density function, then E[esx]=Lf(s)

  2. if f1 and f2 are two probability density functions, then Lf1f2(s)=Lf1(s)Lf2(s)

  3. If F is the cumulative probability distribution for X and p is the probability density function, then LFX(s)=LpX(s)s which can be proven using integration by parts as follows LFX(s)=R0FX(x)d(e(sx))s=0+1sR0pX(x)esxdx

Calculating the Expectation

Armed with the concept of a Laplace transform, we make the following observation first u(t)=i=1Fn(t)=F(t)+i=2Fn(t)=F(t)+(i=1Fn(t))F(t)=F(t)+u(t)F(t)u(t)=F(t)+u(t)p(t) where p is the probability density function and the last line stems from the fact that uF=u(xy)dF(y)=u(xy)p(y)dy. Taking Laplace transform on both sides,

Lu(s)=LF(s)+Lu(s)Lp(s)Lu(s)=Lp(s)s+Lu(s)Lp(s) from point 3 aboveLu(s)=Lp(s)s(1Lp(s))

The last equation can be used to calculate the laplace transform of u(t) and consecutively guess the functional form of u(t).

Limit Theorems for Renewal Processes

The following two theorems hold true for Renewal processes

  1. If E[ξ]=μ<, then limtNtt=1μ which is analogous to the strong law of large numbers. This can be proven as follows SNttSNt+1 from the definition of Ntor, NtSNt+1NttNtSNt we can calculate the limits on the two bounds as limtNtSNt=limnnSn=1μ from the strong law of large numbers applied to limnSnn. Similarly, one can show limtNtSNt+1=limtNtNt+1limtNt+1SNt+1=11μ

  2. If Var(ξ)=σ2<, then limtNtt/μσt/μ3/2=N(0,1) which is analogous to the central limit theorem. It can be proven by considering the CLT on ξs limnP(Snnμσnx)=CDF of N(0,1)or, limnP(Snnμ+σnx)=CDF of N(0,1)or, limnP(Ntn)=CDF of N(0,1) from definition of Nt, where t=nμ+σnx We substitute nμ=t for very large value of n, since the total time will become total variables into the expected time for one ξ when n is large. Hence, n=tμσtμ3/2xlimnP(Ntn)=limnP(Ntt/μσt/μ3/2x)=CDF of N(0,1)