Poisson processes

1 / 49
Outline

I Textbook: Section 5.2 Dimitri

I Content
I Definition of Poisson process as a counting process
I Distribution of inter - arrival time
I Conditional distribution of arrival time
I Compound Poisson process

2 / 49
A motivation - Insurance risk model
(S1 S2 ,
,
...
Sal : accidents (Te T
, ,
...
In) :
amount to
pay for
each
Ts in
in S
> accidents

I Te
> ,
I I I

0 S2 Sa ... Sq 10

I In a portfolio insurance risk such as a portfolio of motor

insurance policies, interest quantities are number of claims
arriving in a fixed period of time and the sizes of those
claim
I modelling number of claims by a counting process such as
Poisson process
I modelling the financial losses which can be suffered by
individuals and insurance companies as a result of
insurable events such as storm or fire damage to property,
theft of personal property and vehicle accidents. One
candidate is compound Poisson process

3 / 49
Table of Contents

Poisson processes
Poisson processes
Arrival, inter-arrival time of a Poisson process

Compound Poisson processes

Simulation

4 / 49
 X Se

3
x1
S1
=
=
1

S2 =

X1 +

Va X
2 =
Se -

S1
Sy x1 x2 x3
Y Ss-Sa
=
+
+ =

Si =

Xy Xe+ + ...
+
Xn X =
Sn-Sn-1

Nt = n c > Sn-t< Sn + 1
No = 0

Nt ~ Poiss (xt)

Nt+s -

Ns ~ Nt-Poiss(xt)
We-No & Nt-Ns nd if OLUC st

5 / 49
 Arrival, inter-arrival time

I Inter-arrival time X1 , X2 , X3 . . .
I Arrival time

S0 = 0
S1 = X 1
S2 = X 1 + X 2
...

I Number of arrival up to time t

1
X
Nt = 1{Sn t} = max{n : Sn  t}
>4 >
8 -
k
I
n=1 #1 :
P(Ng 4) P(N5 -Ng 1) P(W) Ng 3)
= =
- =
= 0 00177
.

8)
P(Ng 4, Ng -Nz_5, Ng P(Ng 4)P(N5 Nz 2) P(NG -Ng 2)
I
=

! !
0 00531
=

k = 2 :
=
- =

= =
.

=
P(Ng =
4, No -Nz x, N =
2)
1) 0 00707
3) P(Ng Ni
=

P(Nz 4) P(Ng Ng
=

k 3
=
= .
- -

1 0
=
: =
=

8
k 0 P(Ng N N3 0, Ng 8)
4,
=
-

= : = =

P(Nz 4) P(Ng -Nz 0(Ng 4) P(Ng 81Ng -Ng 4)

= =

0
= =

Nz
=
= =

P(Nz 4) P(N2 0) P(Ng 4) 0 00021

=

Ng
=
=
= -

5 / 49
= .
 Prisson process with 1
Accidents arrives according to a 2

Poisson processes
=

(wait time = week)

month I month
1) month I
P(Np-No = 4, Ng -No =

L
I
> > L >
I

↓
I
P(N4 4) P(N2 1)
I
1)
P(N4 4), P(Ng No
↳
=
= =
- =
= =

2
4(2 4)
I - 2 2
4 2 6 10 14
4 194 10-3
-

e
.

e
.

4 !Y
= .
.

2:

A Poisson process with intensity (or rate) is a random

(counting) process (Nt )t 0 with the following properties:
nowabout the distributionfor : N4espass.
NasNo
0
1. N0 = 0. 2 e)
same distribution
2. For all t > 0, Nt has a Poisson distribution with Poiss(8)
" P(N4 Ng Ng 10) P(Ng 101N4 Ng 7) P(Ng 71Nq 4) P(N4 4)
parameter t. P(Ng-NG+Ng /N4 Ng 7) P(Ng -Ny +Ny 7/Ny 4) P(N4 4)
= 4, = 7
,

10
=

= 4,
=

=
=

.
=
4 ,
=

=
=
=

=
=
=

7>
=
=

↳
C
10
3. (Stationary increments) For all s, t > 0, Ns+t Ns has the
I

same distribution as Nt . That is, PCNp-No

<4) Ne K
t
e ( t) k k 0

, for
=

P (Ns+t Ns = k) = P (Nt = k) = 4 (2 jk e-
2 .

. 4

k! =

k 0 k!

k = 0, 1, . . . * accident
=

9963 =
0 .

4. (Independent increments) For 0  s < t, Nt Ns and

Nr Nq are independent random variables.
Relative between number of accident over 10 4) and (2 8)
overlapping the
, ,

different period Np-No and No-Ne are related they certain

same
Nis accident Wi5- # s

Na-No
10 , 4) and (10, 15) are
> non-overlapping
I

I s Ny-No and Nis No independent

- are
N8
-
Na
4 10 15
L ,
6 / 49
Some properties of Poisson processes

I The distribution of the number of arrivals in an interval

depends only on the length of the interval
I The number of arrivals on disjoint intervals are
independent random variables
I E(Nt ) = t
I is the average number of arrivals per unit of time.
I when h ⌧ 0 (very small) then

P (Nh = 1) = h + o(h)

and
P (Nh 2) = o(h)

7 / 49
Construct by tossing a low-probability coin very fast

I Pick n large
I A coin with low Head probability n
I Toss this coin at times which are positive integer multiples
of n1
I Nt be number of Head on [0, t]. Then Nt is binomial
distributed and converges to P oiss( t) as n ! 1
I For, Nt+s Ns is indepdendent of the past and Poisson
distributed P oiss( t)
Simulation Poisson process?

8 / 49
Example

Starting at 6 a.m., customers arrive at Martha’s bakery

according to a Poisson process at the rate of 3 customers per
hour. Find the probability that more than 2 customers arrive
between 9 a.m and 11 a.m.

9 / 49
Solution
I Initial time t = 0 (corresponding to 6 a.m)
I Number of customers: Poisson process (Nt )t 0 at rate of 3
customers per hour
I Number of customers up to 9 a.m (t = 3): N3
I Number of customers up to 11 a.m (t = 5): N5
I Number of customers between 9 a.m and 11 a.m:
N5 N3 ,! P oiss((5 3) ) = P oiss(6)
I

P (N5 N3 > 2) = 1 P (N5 N2  2)

=1 [P (N5 N2 = 0) + P (N5 N2 = 1) + P (N5 N2 = 2)]

60 61 62
=1 e 6 +e 6 +e 6
0! 1! 2!

10 / 49
Example
Joe receives text messages starting at 10 a.m. at the rate of 10
texts per hour according to a Poisson process. Find the
probability that he will receive exactly 18 texts by noon (12 a.m.)
and 70 texts by 5 p.m.

11 / 49
Example
Joe receives text messages starting at 10 a.m. at the rate of 10
texts per hour according to a Poisson process. Find the
probability that he will receive exactly 18 texts by noon (12 a.m.)
and 70 texts by 5 p.m.
Solution
I Initial time t = 0 (10 a.m)
I Text message arrival: Poisson process (Nt )t 0 with rate
= 10
I Number of message up to 12a.m (corresponding to time
t = 2) is N2
I Number of message up to 5 p.m (corresponding to time
t = 7) is N7
I Need to find P (N2 = 18, N7 = 70)

11 / 49
P (N2 = 18, N7 = 70) = P (N7 = 70|N2 = 18)P (N2 = 18)
| {z }
multiplication rule

= P (N7 N2 + N2 = 70|N2 = 18)P (N2 = 18)

= P( N7 N2 + 18
|{z} = 70|N2 = 18)P (N2 = 18)
| {z }
independent of N2 substitute N2 by 18

= P( N7 N2 = 52)P ( N2 = 18)
| {z } |{z}
P ois((7 2) )=P oiss(50) P ois(2 )=P oiss(20)

e 50 (50)52 e 20 (20)18
=
52! 18!

12 / 49
Another approach

P (N2 = 18, N7 = 70) = P (N2 = 18, N7 N2 = 52)

| {z }
independent

= P (N2 = 18)P ( N7 N2 = 52)

| {z }
same distribution as N5
= P (N2 = 18)P (N5 = 52)
e 20 (20)18 e 50 (50)52
= = 0.0045 = 0.45%,
18! 52!

13 / 49
Example

On election day, people arrive at a voting center according to a

Poisson process. On average, 100 voters arrive every hour. If
150 people arrive during the first hour, what is the probability
that at most 350 people arrive before the third hour?

14 / 49
Example

On election day, people arrive at a voting center according to a

Poisson process. On average, 100 voters arrive every hour. If
150 people arrive during the first hour, what is the probability
that at most 350 people arrive before the third hour?
Solution
I Number of arrivals (Nt )t 0 is a Poisson process at rate of
= 100 per hour.
I 150 people arrive during the first hour: N1 = 150
I at most 350 people arrive before the third hour: N3  350
I Need to find P (N3  350|N1 = 150)

14 / 49
 P (N3  350|N1 = 150) = P (N3 N1 + N1  350|N1 = 150)
= P (N3 N1  200|N1 = 150)
= P (N3 N1  200) = P (N2  200)
200
X
= P (N2 = k)
k=0
200
X 100⇤2 (100
e ⇤ 2)k
= = 0.519.
k!
k=0

Painful to compute these term directly (out of memory). One

solution is using normal approximation for Poisson distribution

15 / 49
Example
You get email according to a Poisson process at a rate of = 5
messages per hour. You check your email every thirty minutes.
Find
1. P(no message)
2. P(one message)

16 / 49
 Inter-arrival time are i.i.d exponential RVs x
Remind exponential distribution w parameter
x x>, 0
1) pdf f(x) =

)xe- x <0
x

27 edy F(x)
1 e
-
= P(X >x)
x4xx 0
-
=

(pt(n)di
=30
-

uco

3) survival distribution
x 27, 0
F(x)
ye
-

- P(x(n) =

O x<0

F(U1 , Ye) =
P(X, >Ne Xa>
R
,
2
= P(X, x1)P(Xe)x) Fre(n)) =

Fre(ke)
I P (X1 > t) = P (Nt = 0) = e t. Hence X1 ,! Exp( )
I

P (X2 > t|X1 = s) = P (no event in (s,s+t)|X1 = s)

= P (no event in (s,s+t)) (by independent increment)
= P (no event in (0,t)) (by stationary increment)
t
= P (Nt = 0) = e

Hence X2 ,! Exp( ) and independent of X1

17 / 49
Remind exponential distribution parameter i

is pay

a) edy
3) survival distribution

XI has exp(i) :
+30 Exg(t) =
P(X, > t) Nt

=P(S1>t) =
P(Nt = 0)
I 31 =
x1

= e
- xt (xt)" = e
- xt

+ 20 :

Exy(t) =

P(X2 > ! = 1

X has exp(X) and independent of X1 :

P(X2+1 x =

3) only independent out not on s

X1 > t
independent
[ 7

>
& Ye are
I I
Xy =
S + s
Ye> +t
7
event >17
no
X1
[
1
O = +
Xe
IP(Xg>t/X2 = 3) =

P(S2>t /X +

=
1)
1
S1 =

S
10 , e) 10 ,
3) Ne
=

P(Ns+t-Ns =

01Xy =
1)
1
(0 , + +
3) N+ =
+
1
[1 t 3) Nt
Nets
+ =
-

P(Ns+t-Ns = 0) =

P(Nt=0)
xt
Exz(t) P(X2Tt) P(Xe> +/X2 3)
Ge
a 30
+

= =
= =

t 0

>x2 ~exp(X)

Exclt) =
P(X2>t) =

P(X2> +/X1 =
3) =
P(Nt =
0)
-
xt
=e .

>Xe ~exp(X)
 has and ind
-

Y exp(X) of Xe ,
Xe Nic =
2

Ng1 = 1

1) PSXg <t/S2 =

11 , Se = Se) Nt

/
= 0

7
I
>
X3 >t
>

Xy S1=
Xe =
Sa "
=

P(Nt+ 11 1 - N11 + +
se
=
0 /S1 =

11 ,
92 =
Se) S1 =
P1 =estea +
+ t

P(Nt 11 Nar 1 0)
Se
= +
- =
+ +

=
P(Nt =
0)

,
&
Ye , Ye are independent .

2) Ex, (t) P(Xg>t) P(X, >t /51 1 5 12)

=

,
=
=
=

xt
P(Nt 0)
-

=
=
=
e

>X3 ~exp(X)
* P(Xz +A , X2EA ,
X2EA)
=

P(XgEAgI X1A1 ,
XctAe) P(XzGA21X1eAe) P(X1eAe)
Construction by exponential interarrival times

I X1 , X2 , . . . , Xn are i.i.d Exp( )

I Arrival time

S0 = 0
S1 = X 1
S2 = X 1 + X 2
...
Sn = X 1 + X 2 + · · · + X n

I Stop when Sn  t < Sn+1

18 / 49
Arrival time or waiting time Sn

The density function of Sn is given by

t ( t)n 1
fSn (t) = e
(n 1)!

i.e. Sn is Gamma distributed with parameter (n, ) (also called

Erlang)

19 / 49
Proof
I the nth event will occur prior to or at time t if and only if the
number of events occurring by time t is at least n

Sn  t , N t n

I cdf of Sn
1
X 1
X
t( t)k
FSn (t) = P (Sn  t) = P (Nt n) = P (Nt = k) = e
k!
k=n k=n

I pdf of Sn
1 ✓
X ◆
dFSn (t) t( t)k t ( t)k 1
fSn (t) = = e + e
dt k! (k 1)!
k=n
1
X 1
X
t ( t)k t ( t)k 1
= e + e =
k! (k 1)!
k=n k=n

20 / 49
We have
1
X 1
X 1
( t)k 1 ( t)k ( t)n 1 X ( t)k
= = +
(k 1)! k! (n 1)! k!
k=n k=n 1 k=n

So
t ( t)n 1
fSn (t) = e
(n 1)!

21 / 49
 Example
of the 10th event :
astime b > P(S10 -553, 2)

Sw =
X1 X2
+ +
X10 .. . +
=

P(X10 2),

1 1x0(x)dx / -
ex
ECXw)
=

E(S1) =
E(X2) + .. .
+
=
10E(Xa) =
du =
e
-

Xeex's= See a e P(Ser> 20) =

Ststo(n) du = xert (Adt .

e-20x (80.
ECX1) =

Inf(x) =

1 = 1 .

P(Neo < 10) =

Consider a Poisson process with rate = 1. Compute

1. E(time of the 10’th event),
2. P (the 10th event occurs 2 or more time units after the 9th
event),
3. P (the 10th event occurs later than time 20)

22 / 49
Solution
1.
S10 = X1 + · · · + X10
where Xi ,! Exp( )
We have Z 1
x 1
E(Xi ) = x e dx =
0
So
10
E(S10 ) = E(X1 ) + · · · + E(X10 ) = = 10

2.
Z 1
xdx 2 2
P (S10 S9 2) = P (X10 > 2) = e =e =e
2

3.
Z 1 Z 1
t ( t)10 1
P (S10 > 20) = fS10 (t)dt = e dt
20 20 (10 1)!
23 / 49
Example
LetNt be a Poisson process with intensity = 2, and let
X1 , X2 , . . . be the corresponding inter-arrival times.
1. Find the probability that the first arrival occurs after t = 0.5,
i.e., P (X1 > 0.5).
2. Given that we have had no arrivals before t = 1, find the
probability that there is no arrivel up to time 3.
3. Given that the third arrival occurred at time t = 2, find the
probability that the fourth arrival occurs after t = 5.
4. I start watching the process at time t = 10. Let T be the
time of the first arrival that I see. In other words, T is the
first arrival after t = 10. Find E(T ) and V ar(T ).
5. I start watching the process at time t = 10. Let T be the
time of the first arrival that I see. Find the conditional
expectation and the conditional variance of T given that I
am informed that the last arrival occurred at time t = 9.

24 / 49
B x= v
exp(2)
2 0 5
5)
- .

37
.

0
P(X1) .
=

e =
0 .

- P(X2>31X1> 2) =

P(X2> 5)
= e
-

2x(3 -
1)

=
0 0183
.

(X1 & Xs are independent)

3) P(Sp)4/5 ,
= 2) :
=
P(X4 > 2/X1 +
xz +

xz =
a)
P(Xp> 2) P(Nq 3/5,
=

2)

I
=

=
=

P(N+= 31 N2 = 3
,
N2- N2 =

1)
=P(Np-N2 =
0 / Ne =
3
,
Ne -Ne-= 1)
=P(Np-Ne = 0) =

P(Nz =
0) =
0 .
0183 .

T
47 I * S
I

8 W ist event
that
I've seem
T =
N + X

ECT) 10 + 1/2 21/2

N ECX)
=

=
+ =

Var(T) =
var(x) =

&
Find distribution X:
of
P(X<t) 07 PINt 07
=

P(Nott - Mo = = =

- 2t
=e

->
X- exp(2) -> E(X)=
& Var(x) =

I
 5)
ECF/Ng -Ng -= 1
,
No Ng -
= 07
03
var
(TINg -Ng - = 1
, No-Ng =

Find conditional distribution

of X
given Ng Ng-= -
1
, No Ngi
P(x>+1 Ng -
Ng -=
1
, New-Ng =

07

=P(Nott -
No =

01Ng-Ng-= 1
,
No-Ng =
07

2t
P(N10+t-N10 0) P(N+
-
=

=
= = 0) =
e

depends the arival

of the
-> X does not on time last

event

-> x -
exp(C) - E(X) 2 Var(X)
I
=

,
=

ECTINg-Ng -= 1
, No-Ng = 0) =
ECT) =

&
Var
(T1Wg-Ng -= 1
Mo-Ng 0) Var (T)
=
=

=var(X)
I
=
Order statistic

Let X1 , X2 , ..., Xn be rv then X(1) , X(2) , ..., X(n) are the order
statistics corresponding to X1 , X2 , ..., Xn if X(k) is the
k-smallest value among X1 , X2 , ..., Xn .

Property
If U1 , U2 , ..., Un are i.i.d uniformly distributed U ([0, t]) then the
joint pdf of U(1) , U(2) , ..., U(n) is

n!
f (x1 , ..., xn ) =
tn
for 0  x1  x2 ...  xn  t

25 / 49
Proof

I joint pdf of U1 , U2 , ..., Un is t1n

I U(1) , U(2) , ..., U(n) is equal to (x1 , x2 ..., xn ) when
U1 , U2 , ..., Un is equal to any of n! permutation of
(x1 , x2 ..., xn ).
I the joint pdf of U(1) , U(2) , ..., U(n) is

n!
f (x1 , ..., xn ) =
tn

26 / 49
Conditional distribution of arrival times

Given that Nt = n, the n arrival times S1 , ..., Sn have the same

distribution as order statitics corresponding to n independent
random variables uniformly distributed on [0, t].

27 / 49
Proof

Let 0 < t1 < t2 < ... < tn < tn+1 = t and hi be small enough such
ti + hi < ti+1

P (ti  Si  ti + hi , i = 1, ..., n|Nt = n)

P (ti  Si  ti + hi , i = 1, ..., n, Nt = n)
=
P (Nt = n)
P (exact 1 event in [ti , ti + hi ]), i = 1, ..., n, no event elsewhere in [0, t]
= n
e t ( t)
n!
h1 h2 hn (t h1 ... hn )
h1 e ... h2 e ... hn e e
= t)n
e t(
n!
n!
= n h1 h2 ...hn
t

28 / 49
 @ n F(S1 ,...,Sn )|Nt =n
f(S1 ,...,Sn )|Nt =n (t1 , . . . , tn ) = (t1 , . . . , tn )
@t1 . . . @tn
F(S1 ,...,Sn )|Nt =n (t1 + h1 , . . . , tn + hn ) F(S1 ,...,Sn )|Nt =n (t1 , . . . , tn
= lim
h1 ,...,hn !0 h 1 . . . hn
P (ti  Si  ti + hi , i = 1, ..., n|Nt = n) n!
= lim = n
h1 ,...,hn !0 h1 ...hn t

So given Nt = n, (S1 , . . . , Sn ) has the same distribution as

(U(1) , . . . , U(n) )

29 / 49
Construction by conditional distribution of arrival times

I Determine the number of arrivals Nt which is Poisson

distributed P oiss( t)
I Nt i.i.d U ni([0, t]): U1 , U2 , . . . , UNt
I Sort Ui to obtain arrival time S1 , S2 , . . .

30 / 49
Example
Let Nt be a Poisson process with rate = 2 with arrival time
S1 , S2 , . . . . Find

E(S1 + S2 + · · · + S10 |N4 = 10)

31 / 49
Example
Let Nt be a Poisson process with rate = 2 with arrival time
S1 , S2 , . . . . Find

E(S1 + S2 + · · · + S10 |N4 = 10)

Solution
I Given N4 = 10, (S1 , . . . , S)10) has the same joint
distribution as (U(1) , U(2) , . . . U(10) ) where Ui are i.i.d
U ni(0, 4)
I E(S1 + S2 + · · · + S10 |N4 = 10) = E(U(1) + · · · + U(10) )
I U(1) + . . . U(10) = U1 + . . . U10
I E(S1 + S2 + · · · + S10 |N4 = 10) = E(U1 + · · · + U10 ) =
E(U1 ) + · · · + E(U10 )
I Ui ,! U ni([0, 4]) ) E(Ui ) = 0+4 2 =2
I E(S1 + S2 + · · · + S10 |N4 = 10) = 10 ⇥ 2 = 20
31 / 49
Example

Suppose that travelers arrive at a train depot accordance with a

Poisson process with rate . If the train departs at time t,
compute the expected sum of the waiting times of travelers
arriving in (0, t) !
Nt
X
E (t Si )
i=1

32 / 49
Solution ! " !#
Nt
X Nt
X
Using property E (t Si ) =E E (t Si )|Nt
i=1 ! i=1
Nt
X
Find E (t Si )|Nt
i=1
I
Nt
! n
!
X X
E (t Si )|Nt = n =E (t Si |Nt = n)
i=1 i=1
n
!
X
=E (t U(i) ) where Ui ,! U ([0, t])
i=1
n
!
X
=E (t Ui ) = nE(t U1 ) = n(t t/2) = nt/2
i=1
Nt
!
X tNt
I E (t Si )|Nt =
2
i=1
33 / 49
Hence
Nt
! ✓ ◆
X tNt t t t2
E (t Si ) =E = E(Nt ) = ( t) =
2 2 2 2
i=1

34 / 49
Table of Contents

Poisson processes

Compound Poisson processes

Simulation

35 / 49
Compound Poisson Processes

Let W1 , W2 , ... be a sequence of i.i.d rv with cdf F and

independent of a Poisson process (Nt )t 0 with rate then the
process (Rt )t 0 with
XNt
Rt = Wi
i=1

is called by a compound Poisson process.

36 / 49
Example

Suppose that health claims are filed with a health insurer at the
Poisson rate per day, and that the independent severities W of
each claim are exponential random variables . Then the
aggregate R of claims is a compound Poisson process.

37 / 49
Properties of compound Poisson processes

1. E(Rt ) = tE(W ) (Tower property)

2. V ar(Rt ) = tE(W 2 )

38 / 49
Proof
Using property
E(X) = E(E(X|Y ))
for Y = Nt
1. Compute E(Rt |Nt )
Nt
! Nt
!
X X
E(Rt |Nt = n) = E Wi =E Wi |Nt = n
i=1 i=1
0 1
B n independent of Nt C
B X z}|{ C
=EB
B Wi |Nt = nC
C
@ i=1 A
|{z}
substitute Nt by n

39 / 49
 n
!
X
E(Rt |Nt = n) = E Wi
i=1
n
X
= E(Wi ) = nE(W )
| {z }
i=1
=E(W )

So
E(Rt |Nt ) = Nt E(W )
Hence

E(Rt ) = E(E(Rt |Nt )) = E(Nt E(W ) = E(Nt )E(W ) = tE(W )

| {z }
constant

40 / 49
2.

V ar(Rt ) = E(Rt2 ) (E(Rt ))2 = E(Rt2 ) 2 2

t (E(W ))2

Compute E(Rt2 |Nt )

2 !2 3
Nt
X
E(Rt2 |Nt = n) = E 4 Wi |Nt = n5
i=1
2 !2 3
n
X
=E4 Wi |Nt = n5
i=1
n
!2
X
=E Wi
i=1

41 / 49
We have
n
!2 n n
X X X
Wi = Wi2 + Wi Wj
i=1 i=1 i6=j,i,j=1

So
n
!2 n n
X X X
E Wi = E(Wi2 ) + E(Wi Wj )
i=1 i=1 i6=j,i,j=1
Xn X n
= E(Wi2 ) + E(Wi )E(Wj )
i=1 i6=j,i,j=1

= nE(W 2 ) + n(n 1)(E(W ))2

Hence E(Rt2 |Nt = n) = nE(W 2 ) + n(n 1)(E(W ))2 then

E(Rt2 |Nt ) = Nt E(W 2 ) + Nt (Nt 1)(E(W ))2

42 / 49
E(Rt2 ) = E(E(Rt |Nt )) = E(Nt )E(W 2 ) + E(Nt (Nt 1))(E(W ))2

Because Nt ,! P oiss( t),

E(Nt ) = t, V ar(Nt ) = E(Nt2 ) (E(Nt ))2 = t

we have E(Nt2 ) = V ar(Nt ) + (E(Nt ))2 = t + ( t)2 and then

ENt (Nt 1) = E(Nt2 ) E(Nt ) = t + ( t)2 t = ( t)2

) E(Rt2 ) = tE(W 2 ) + ( t)2 (E(W ))2
) V ar(Rt ) = E(Rt2 ) 2 2
t (E(W ))2 = tE(W 2 )

43 / 49
Example

Consider the compound Poisson process modeling aggregate

health claims; frequency N is a Poisson process with rate
= 20 per day and severity W is an Exponential random
variable with mean ✓ = 500. Suppose that you are interested in
the aggregate claims S10 during the first 10 days.
1. Find E(R10 )
2. Find V ar(R10 )

44 / 49
Solution

1. E(R10 ) = E(N10 )E(W ) = (20 ⇥ 10)(500) = 100, 000

because N10 ,! P ois( t) = P ois(20 ⇥ 10)
2. V ar(R10 ) = E(N10 )E(W 2 ) = 200 ⇥ (5002 ) = 100, 000, 000

45 / 49
An application of compound Poisson process in
insurance: Cramer-Lundberg model

In insurance, compound Poisson process is used to model total

claim amount on [0, t]. If premium arrives with rate c then the
insurer’s surplus level with inital surplus x is
Nt
X
Ut = x + ct Wi
i=1

A central object is to find the ruin probability that the insurer’s

surplus falls below 0 (firm bankrupts)

46 / 49
Table of Contents

Poisson processes

Compound Poisson processes

Simulation

47 / 49
Simulation practice
1. Simulate a path of Poisson process with rate = 2 on
interval time [0, 10] by simulating inter-arrival time
2. Simulate a path of Poisson process with rate = 2 on
interval time [0, 10] by simulating number of event Nt first
and then arrival times (using conditional distribution of
arrival times)
3. Simulate a path of insurance surplus on [0, 10] with
I (Nt )t is a poisson process with rate =2
I Claim size Wk ,! Exp(1)
4. Estimate ruin probability of the previous problem on finite
horizon time [0, 10] with c = 1, x = 10, (Nt )t is a poisson
process with rate = 2, claim size Wk ,! Exp(1)
5. Which value of c should be to guarantee that the ruin
probability over horizon time [0, 10] is less or equal to 10 3.

Use set up as the previous as (except value of c)

48 / 49
Practice

Consider the compound Poisson process modeling aggregate

health claims; frequency N is a Poisson process with rate
= 20 per day and severity W is an Exponential random
variable with mean ✓ = 500. Simulate 10000 scenarios for the
aggregate claims S10 during the first 10 days.
1. Estimate E(R10 ) and V ar(R10 ) from simulated sample.
2. Plot histogram for simulated sample of R10 . What can you
say about the distribution of R10 .
3. Propose an approximation or estimation for
P (R10 > 120, 000).

49 / 49