5 Continuous Markov chains

5.6 Poisson processes

Definition 5.6.1.

The temporal Poisson Process (P.P.) is a cts homogeneous MC N⁢(t). It is defined to be the number of events in the interval (0,t], which occur at random, independently, and with a fixed rate λ per unit time.

We describe this, to first order, for small h>0

P[N(t+h)=j|N(t)=i]≈{0ifj<i,1-λ⁢hifj=i,λ⁢hfj=i+1,0ifj>i+1.

Consequently, N⁢(t) has PT rate matrix

Q=(-λλ0⋯⋯0-λλ0⋯00-λλ⋯⋮⋮⋮⋮)

or, specifically, Qi⁢j=λ for j=i+1, Qi⁢i=-λ and otherwise Qi⁢j=0.

Now let the distribution of N⁢(t) be π⁢(t)=(π⁢(t)0,π⁢(t)1,π⁢(t)2,…), i.e. π(t)j=P(N(t)=j).

Theorem 5.6.2.

For the Poisson process

π⁢(t)j=exp⁡(-λ⁢t)⁢(λ⁢t)jj!.

i.e. N⁢(t) has a Poisson distribution with mean λ⁢t.

Proof.

From π′⁢(t)=π⁢(t)⁢Q we have the first equation

π′⁢(t)0=-λ⁢π⁢(t)0⇒d⁢π0π0=-λ⁢d⁢t⇒[log⁡π⁢(t)0]0t=[-λ⁢t]0t⇒log⁡π⁢(t)0=-λ⁢t

since π⁢(0)0=1. This gives the first term in the distribution,

π⁢(t)0=exp⁡(-λ⁢t).

The equation for the transition to state k+1 gives, for all k≥0:

π′⁢(t)k+1=λ⁢π⁢(t)k-λ⁢π⁢(t)k+1. (5.1)

This is both a difference and differential equation. To solve this let

π⁢(t)k=exp⁡(-λ⁢t)⁢ρ⁢(t)k

noting that ρ⁢(0)k=π⁢(0)k=0 for k≥1 and ρ⁢(t)0=1. By definition, π⁢(t)k+1=exp⁡(-λ⁢t)⁢ρ⁢(t)k+1. Differentiating this gives

π′⁢(t)k+1=exp⁡(-λ⁢t)⁢ρ′⁢(t)k+1-λ⁢exp⁡(-λ⁢t)⁢ρ⁢(t)k+1. (5.2)

Equating (5.1) and (5.2) gives

exp⁡(-λ⁢t)⁢ρ′⁢(t)k+1-λ⁢exp⁡(-λ⁢t)⁢ρ⁢(t)k+1=λ⁢exp⁡(-λ⁢t)⁢ρ⁢(t)k-λ⁢exp⁡(-λ⁢t)⁢ρ⁢(t)k+1,

which simplifies by cancellation to

ρ′⁢(t)k+1=λ⁢ρ⁢(t)k.

Now ρ⁢(t)0=1, so

ρ′⁢(t)1=λ⁢ρ⁢(t)0=λ⇒ρ⁢(t)1=λ⁢t

by direct integration. Similarly

ρ′⁢(t)2=λ⁢ρ⁢(t)1=λ2⁢t⇒ρ⁢(t)2=λ2⁢t22.

Continuing in this way (formally by induction) we obtain

ρ⁢(t)k=λk⁢tkk!

which gives the required result. ∎

5.6.1 The Exponential and Gamma distributions for waiting times

From the result 5.2.1 about the length of stay in a given state, we can immediately deduce that the intervals between events occurring in the Poisson process all have an exponential distribution with mean 1/λ. Also these intervals are independent since the length of stay in a state does not depend on what went before.

The time Tn to the nth event in the process is then the sum of the n independent intervals between these first n events, i.e. the sum of n independent exponential random variables. The relationship between the counting process N⁢(t) and the interval process Tn is captured in probability terms by the equation:

P(Tn≤t)=P(N(t)≥n).

The cdf for the time to the nt⁢h event, Fn⁢(t), is therefore

1-e-λ⁢t⁢∑i=0n-1(λ⁢t)ii!.

Differentiating this gives the pdf

λ⁢e-λ⁢t⁢∑i=0n-1(λ⁢t)ii!-e-λ⁢t⁢∑i=1n-1λ⁢(λ⁢t)i-1(i-1)! = λ⁢e-λ⁢t⁢(∑i=0n-1(λ⁢t)ii!-∑i=0n-2(λ⁢t)ii!)
= λn⁢tn-1(n-1)!⁢e-λ⁢t.

This is the pdf of a gamma distribution.

Exercise 5.6.3.

Given λ=0.5, calculate the probability that the third event occurs in the interval [4<t≤6]. ( First evaluate P(T3>4) and P(T3>6) ).

We need

P(T3>4)-P(T3>6) = ∑i=022i⁢e-2/i!-∑i=023i⁢e-3/i!
= e-2⁢(1+2+2)-e-3⁢(1+3+9/2)
= 5⁢e-2-172⁢e-3.