Banhemman Flashcards
Name 2 count distributions
- Poisson
- Negative Binomial
For Poisson distribution, identify f(n), E(N) and V(N)
E(N) = V(N) = u
f(n) = u^n * exp(-u) / n!
For Negative Binomial distribution, identify f(n), E(N) and V(N)
f(n) = (r+n-1 chose n)p^n(1-p)^r
E(N) = pr/(1-p)
V(N) = pr/(1-p)^2
For Uniform distribution, identify f(x), F(x), E(X) and V(X)
f(x) = 1/(b-a)
F(x) = (x-a)/(b-a)
E(X) = (b+a)/2
V(X) = (b-a)^2 / 12
For Exponential distribution, identify f(x), F(X), E(X) and V(X)
f(x) = exp(-x/b) / b
F(x) = 1 - exp(-x/b)
E(X) = b
V(X) = b^2
For Gamma distribution, identify E(X) and V(X)
E(X) = ab
V(X) = a*(b^2)
For Lognormal distribution, identify E(X) and V(X)
E(X) = exp(u+s^2/2)
V(X) = (exp(s^2) - 1)*exp(2u+s^2)
u = ln(mean) - s^2/2
s^2 = ln(CV^2+1)
For Shifted Pareto distribution, identify f(x), F(X), E(X) and V(X)
f(x) = a(b^a)/(x+b)^(a+1)
F(x) = 1 - (b/(x+b))^a
E(X) = b/(a-1)
V(X) = a(b^2)/((a-1)^2*(a-2))
For Weibull distribution, identify f(x), F(X)
f(x) = (d/(b^d))x^(d-1)exp(-(x/b)^d)
F(x) = 1 - exp(-(x/b)^d)
Discuss 4 methods for estimating distribution parameters
- Methods of moments
Compute moments for different values of m, set them equal to theoretical values and use sample data to solve for parameters - Maximum likelihood
For sample data with n observations, create log-likelihood function, create log-likelihood function sum of lnf(xi), take derivatives with respect to each parameter, set equal to 0 and solve for estimated parameters. - Minimum chi-squared
Create m ranges of claim size intervals. Tabulate actual claim counts in each range and expected counts using target distribution with initial seed parameters. Calculate Chi-squared values:
X^2 = sum of (A - E)^2 / E
And use computer to iterate different parameter choices until X^2 is minimized. - Minimum distance
Create m ranges of claim size intervals. Tabulate cum % of actual claim counts from sample data for each range and expected cum % using target distribution with initial seed parameters. Calculate:
D =(Sum of (Fn(Ck) - Fo(Ck))^2)^0.5
Use computer to iterate different parameter choices until D is minimized.
Define truncation (aka discarding)
Usually in case of claims below deductible.
They do not even appear in insurer’s data
Define censoring (aka capping)
Usually in case of a limit
Define Shifting
Usually with a straight deductible.
For claims larger than deductible they get reduced (shifted) by deductible amount.
Explain Panjer’s recursive algorithm
Recursive algorithms can be used to approx real aggregate loss distributions.
Panjer’s recursive algorithm generates an aggregate loss distribution given equally-spaced discrete severity distribution with spacing h and count distribution N that satisfies fN(n) = (na+b)fN(n-1)/n
Both Poisson (a=0, b=u) and NB (a=p, b=(r-1)p) satisfies the relationship.
Assuming fx(0) = 0, we have
fs(0) = fN(0)
fs(mh) = P(S = mh) = sum over k of (a+bk/m)fx(kh)fs(mh-kh)
Given Y = max(0, X-a), calculate
1. Mean insurance pmt
2. Prob insurer pays 0
3. Limited E(XS) value
4. pdf of Xa
- E(Y) = E(X) - E(X;a)
- Fx(a) = P(X<=a)
- E(Xa;l) = E(X;a+l) - E(X;a) / (1-Fx(a))
- fXa(x) = fx(x+a)/(1-Fx(a))
Explain how severity curve can be used to fit theoretical curve
We can calculate XS severity at various limits using empirical data and then compare that to theoretical curve
Straight line going up -> Pareto -> slope is 1/(a-1) and intercept is b/(a-1)
Increasing XS Sev -> Weibull
Hockey stick -> Lognormal
Decreasing XS Sev -> Gamma
Flat -> exponential -> b = XS Sev