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.

Bonus-Malus Scales 175<br />

as p n<br />

l 1 l 2<br />

, is the probability <strong>of</strong> moving from level l 1 to level l 2 in n transitions. Using<br />

Property 4.1, we get the following representation for the distribution <strong>of</strong> the state variable L n :<br />

denoting as<br />

we have<br />

p k = ( PrL k = 0PrL k = s ) T<br />

<br />

p k+n = p k P n (4.6)<br />

Remark 4.1 (Numerical Aspects) The computation <strong>of</strong> the probability distribution <strong>of</strong> L n <br />

amounts to calculating the nth power <strong>of</strong> the transition matrix P. For large values <strong>of</strong> n, this<br />

may pose some computational difficulties. This is why we now discuss an algebraic method<br />

which makes use <strong>of</strong> the concept <strong>of</strong> eigenvalues and eigenvectors (that will be encountered<br />

further in this chapter).<br />

The vector v with at least one component different from 0 is a right eigenvector <strong>of</strong> P if<br />

Pv = v for some ∈ . In this case, is said to be an eigenvalue <strong>of</strong> P. Finding the<br />

eigenvalues <strong>of</strong> P amounts to solving the characteristic equation detP − I = 0. A<br />

nonzero vector u that is a solution <strong>of</strong> u T P = u T is called a left eigenvector corresponding<br />

to .<br />

In general, the characteristic equation possesses s + 1 solutions 0 s which can be<br />

complex and some <strong>of</strong> them can coincide (we assume that the eigenvalues are numbered so<br />

that 0 ≥ 1 ≥···≥ s ). The Perron-Froebenius theorem for regular matrices ensures<br />

that<br />

∑<br />

provided the transition matrix P is regular then 0 = 1, v 0 = e, u 0 ≥ 0 with u T e =<br />

s<br />

j=0 u 0j = 1. Moreover, all the other eigenvalues <strong>of</strong> P lie inside the unit circle <strong>of</strong> the<br />

complex plane, that is j < 1 for j = 1s.<br />

Let V = v 0 v s be an s +1×s +1 matrix consisting <strong>of</strong> right column eigenvectors<br />

and<br />

⎛<br />

⎜<br />

U = ⎝<br />

an s + 1 × s + 1 matrix consisting <strong>of</strong> left column eigenvectors. Let us assume that the<br />

eigenvalues 0 s are distinct. This ensures that v 0 v s are linearly independent so<br />

that V is invertible. Moreover, U = V −1 . In this case, P can be represented as<br />

⎛<br />

⎞<br />

0 ··· 0<br />

⎜<br />

P = V<br />

⎝<br />

<br />

<br />

⎟<br />

s∑<br />

⎠ U = j v j u T j <br />

j=0<br />

0 ··· s<br />

u T 0<br />

<br />

u T s+1<br />

This representation is useful for computing the nth power <strong>of</strong> P in that<br />

⎛<br />

⎞<br />

n 0<br />

··· 0<br />

P n ⎜<br />

= V ⎝<br />

<br />

<br />

⎟<br />

s∑<br />

⎠ U = n j v ju T j <br />

0 ··· n j=0<br />

s<br />

⎞<br />

⎟<br />

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

Saved successfully!

Ooh no, something went wrong!