01.06.2015 Views

Actuarial Modelling of Claim Counts Risk Classification, Credibility ...

Actuarial Modelling of Claim Counts Risk Classification, Credibility ...

Actuarial Modelling of Claim Counts Risk Classification, Credibility ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

18 <strong>Actuarial</strong> <strong>Modelling</strong> <strong>of</strong> <strong>Claim</strong> <strong>Counts</strong><br />

claims in a sufficiently small time interval is negligible when compared to the probability<br />

that he reports zero or only one claim.<br />

Link with the Poisson Distribution<br />

The Poisson process is intimately linked to the Poisson distribution, as precisely stated in<br />

the next result.<br />

Property 1.1 For any Poisson process, the number <strong>of</strong> events in any interval <strong>of</strong> length t is<br />

Poisson distributed with mean t, that is, for all s t ≥ 0,<br />

PrNt + s − Ns = n = exp−t tn n= 0 1 2<br />

n!<br />

Pro<strong>of</strong> Without loss <strong>of</strong> generality, we only have to prove that Nt ∼ oit. For any<br />

integer k, let us denote p k t = PrNt = k, t ≥ 0. The announced result for k = 0 comes<br />

from<br />

p 0 t + t = PrNt = 0 and Nt + t − Nt = 0<br />

= PrNt = 0 PrNt + t − Nt = 0<br />

= p 0 tp 0 t<br />

= p 0 t ( 1 − t + ot ) <br />

where the joint probability factors into two terms since the increments <strong>of</strong> a Poisson process<br />

are independent random variables. This gives<br />

p 0 t + t − p 0 t<br />

t<br />

Taking the limit for t ↘ 0 yields<br />

=−p 0 t + ot p<br />

t 0 t<br />

d<br />

dt p 0t =−p 0 t<br />

This differential equation with the initial condition p 0 0 = 1 admits the solution<br />

p 0 t = exp−t (1.18)<br />

which is in fact the oit probability mass function evaluated at the origin.<br />

For k ≥ 1, let us write<br />

p k t + t = PrNt + t = k<br />

= PrNt + t = kNt = k PrNt = k<br />

+ PrNt + t = kNt = k − 1 PrNt = k − 1<br />

k∑<br />

+ PrNt + t = kNt = k − j PrNt = k − j<br />

j=2

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!