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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

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

mixing distributions examined in Chapter 2 are all unimodal. Henceforth, we denote by<br />

s 0 b m − unim the unimodal moment space <strong>of</strong> all the random variables <strong>of</strong> this type.<br />

In the following, we use the notation nim z, with m, z ∈ , for the Uniform<br />

distribution on the interval minm z maxm z: ifmz, it is the law<br />

with constant probability density function equal to 1/m − z on z m; ifm = z, itisthe<br />

law degenerated at the point m. Given some random variable Z, we denote by nim Z<br />

the mixed Uniform distribution with random extremal point Z as mixing parameter.<br />

A convenient representation <strong>of</strong> unimodal distributions is provided by Khinchine’s theorem<br />

(see, e.g., Theorem 1.3 in Dharmadhikari & Joag-Dev (1988)). This theorem states that a<br />

random variable Y has a unimodal law with a mode at 0 if, and only if, Y is distributed as<br />

UZ where U and Z are two independent random variables and U ∼ ni0 1. This condition<br />

can be rewritten as Y ∼ ni0Z for some random variable Z.<br />

Now, let X be any random variable valued in 0b and with a unique mode at m. By<br />

Khinchine’s theorem,<br />

X ∼ nim˜Z where ˜Z = m + Z (3.10)<br />

Note that Z is valued in −m b − m. Moreover, the moments j <strong>of</strong> X and ˜ j <strong>of</strong> ˜Z are<br />

linked by simple relations. Indeed, we have<br />

∫ ( 1<br />

∫ m<br />

)<br />

j =<br />

x j dx dF˜Z<br />

m − z<br />

z<br />

x=z<br />

∫<br />

m j+1 − z j+1<br />

=<br />

dF˜Z z<br />

m − zj + 1<br />

= 1 ∫<br />

m j + m j−1 z + m j−2 z 2 +···+z j dF˜Z<br />

j + 1<br />

z<br />

<br />

= 1<br />

j + 1 mj + m j−1˜ 1 + m j−2˜ 2 +···+˜ j j = 1 2 (3.11)<br />

From (3.11), we get<br />

˜ j = j + 1 j − mj j−1 j = 1 2 (3.12)<br />

Let us now come back to (3.8) in s 0 b m − unim . Specifically, we would like to<br />

determine the random variables X s⋆<br />

min<br />

and Xs⋆ max such that the inequalities<br />

EX s⋆<br />

min s ≤ EX s ≤ EX s⋆<br />

max s hold for all X ∈ s 0 b m − unim (3.13)<br />

As shown in Denuit, De Vylder & Lefèvre (1999), the random variables X s⋆<br />

min<br />

and Xs⋆ max<br />

involved in (3.13) give bounds on EX for every s-convex function . Finding the<br />

solution <strong>of</strong> (3.13) for X in s 0 b m − unim thus amounts to solving the corresponding<br />

problem in s 0 b ˜.<br />

Tables 3.8–3.9 give explicit expressions for the improved extremal distributions, also for<br />

values <strong>of</strong> s up to five. In these tables ∑ k<br />

i=1 p ini i i ,0≤ p i ≤ 1, i i ∈ , i = 1 2k,<br />

represents a mixture <strong>of</strong> the distributions ni i i , with respective weights p i .

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

Saved successfully!

Ooh no, something went wrong!