Approximation of the conditional number of exceedances Han Liang - - PowerPoint PPT Presentation

approximation of the conditional number of exceedances
SMART_READER_LITE
LIVE PREVIEW

Approximation of the conditional number of exceedances Han Liang - - PowerPoint PPT Presentation

Approximation of the conditional number of exceedances Han Liang Gan University of Melbourne July 9, 2013 Joint work with Aihua Xia Han Liang Gan Approximation of the conditional number of exceedances 1 / 16 Conditional exceedances Han


slide-1
SLIDE 1

Approximation of the conditional number of exceedances

Han Liang Gan

University of Melbourne

July 9, 2013 Joint work with Aihua Xia

Han Liang Gan Approximation of the conditional number of exceedances 1 / 16

slide-2
SLIDE 2

Conditional exceedances

Han Liang Gan Approximation of the conditional number of exceedances 2 / 16

slide-3
SLIDE 3

Conditional exceedances

Given a sequence of identical but not independent random variables X1, . . . , Xn, define Ns,n =

n

  • i=1

1{Xi>s}.

Han Liang Gan Approximation of the conditional number of exceedances 2 / 16

slide-4
SLIDE 4

Conditional exceedances

Given a sequence of identical but not independent random variables X1, . . . , Xn, define Ns,n =

n

  • i=1

1{Xi>s}. The fragility index of order m, denoted FIn(m) is defined as FIn(m) = lim

sր E(Ns,n|Ns,n ≥ m).

Han Liang Gan Approximation of the conditional number of exceedances 2 / 16

slide-5
SLIDE 5

Conditional exceedances

Given a sequence of identical but not independent random variables X1, . . . , Xn, define Ns,n =

n

  • i=1

1{Xi>s}. The fragility index of order m, denoted FIn(m) is defined as FIn(m) = lim

sր E(Ns,n|Ns,n ≥ m).

Applications: Insurance.

Han Liang Gan Approximation of the conditional number of exceedances 2 / 16

slide-6
SLIDE 6

Compound Poisson limit

Under certain conditions, Tsing et. al. (1988) showed that the exceedance process converges to a Compound Poisson limit.

Han Liang Gan Approximation of the conditional number of exceedances 3 / 16

slide-7
SLIDE 7

Assumptions

Han Liang Gan Approximation of the conditional number of exceedances 4 / 16

slide-8
SLIDE 8

Assumptions

Existence of the limits.

Han Liang Gan Approximation of the conditional number of exceedances 4 / 16

slide-9
SLIDE 9

Assumptions

Existence of the limits. Tail behaviour is nice enough.

Han Liang Gan Approximation of the conditional number of exceedances 4 / 16

slide-10
SLIDE 10

Assumptions

Existence of the limits. Tail behaviour is nice enough. Mixing condition.

Han Liang Gan Approximation of the conditional number of exceedances 4 / 16

slide-11
SLIDE 11

Assumptions

Existence of the limits. Tail behaviour is nice enough. Mixing condition. Uniform convergence.

Han Liang Gan Approximation of the conditional number of exceedances 4 / 16

slide-12
SLIDE 12

Assumptions

Existence of the limits. Tail behaviour is nice enough. Mixing condition. Uniform convergence. Uniform integrability.

Han Liang Gan Approximation of the conditional number of exceedances 4 / 16

slide-13
SLIDE 13

Alternatives

In contrast to limit theorems, we can use approximation theory. Our tool

  • f choice will be Stein’s method.

Han Liang Gan Approximation of the conditional number of exceedances 5 / 16

slide-14
SLIDE 14

Alternatives

In contrast to limit theorems, we can use approximation theory. Our tool

  • f choice will be Stein’s method.

For the next section of the talk, we shall stick to conditioning on just one exceedance, Poisson approximation, and total variation distance.

Han Liang Gan Approximation of the conditional number of exceedances 5 / 16

slide-15
SLIDE 15

A simple example

Let X1, . . . , Xn be a sequence of i.i.d. exponential random variables, p = ps = P(X1 > s) and Zλ ∼ Po(λ).

Han Liang Gan Approximation of the conditional number of exceedances 6 / 16

slide-16
SLIDE 16

A simple example

Let X1, . . . , Xn be a sequence of i.i.d. exponential random variables, p = ps = P(X1 > s) and Zλ ∼ Po(λ). dTV (L(N1), Po1(λ)) = 1 2

  • j=1
  • P(N1 = j) − P(Z 1

λ = j)

  • .

Han Liang Gan Approximation of the conditional number of exceedances 6 / 16

slide-17
SLIDE 17

A simple example (2)

Set λ such that e−λ = (1 − p)n.

Han Liang Gan Approximation of the conditional number of exceedances 7 / 16

slide-18
SLIDE 18

A simple example (2)

Set λ such that e−λ = (1 − p)n. So now we have dTV (L(N1), Po1(λ)) = 1 2(1 − P(N = 0))

  • j=1

|P(N = j) − P(Zλ = j)| .

Han Liang Gan Approximation of the conditional number of exceedances 7 / 16

slide-19
SLIDE 19

A simple example (3)

Set λ∗ = np, and we can reduce the problem to known results. dTV (L(N1), Po1(λ)) = 1 2(1 − P(N = 0))

  • j=1

[|P(N = j) − P(Zλ∗ = j)| + |P(Zλ∗ = j) − P(Zλ = j)|].

Han Liang Gan Approximation of the conditional number of exceedances 8 / 16

slide-20
SLIDE 20

A simple example (3)

Set λ∗ = np, and we can reduce the problem to known results. dTV (L(N1), Po1(λ)) = 1 2(1 − P(N = 0))

  • j=1

[|P(N = j) − P(Zλ∗ = j)| + |P(Zλ∗ = j) − P(Zλ = j)|]. Using results from Barbour, Holst and Janson (1992), it can be shown that: dTV (L(N1), Po1(λ)) = p + o(p).

Han Liang Gan Approximation of the conditional number of exceedances 8 / 16

slide-21
SLIDE 21

The conditional Poisson Stein Identity

Lemma

W ∼ Po1(λ) if and only if for all bounded functions g : Z+ → R, E

  • λg(W + 1) − Wg(W ) · 1{W ≥2}
  • = 0.

Han Liang Gan Approximation of the conditional number of exceedances 9 / 16

slide-22
SLIDE 22

Stein’s method in one slide

We construct a function g for any set A, that satisfies: 1{j∈A} − Po1(λ){A} = λg(j + 1) − jg(j) · 1{j≥2}.

Han Liang Gan Approximation of the conditional number of exceedances 10 / 16

slide-23
SLIDE 23

Stein’s method in one slide

We construct a function g for any set A, that satisfies: 1{j∈A} − Po1(λ){A} = λg(j + 1) − jg(j) · 1{j≥2}. It now follows that, P(W ∈ A) − Po(λ){A} = E

  • λg(W + 1) − Wg(W ) · 1{W ≥2}
  • .

Han Liang Gan Approximation of the conditional number of exceedances 10 / 16

slide-24
SLIDE 24

Stein’s method in one slide

We construct a function g for any set A, that satisfies: 1{j∈A} − Po1(λ){A} = λg(j + 1) − jg(j) · 1{j≥2}. It now follows that, P(W ∈ A) − Po(λ){A} = E

  • λg(W + 1) − Wg(W ) · 1{W ≥2}
  • .

We then only need to bound the right hand side.

Han Liang Gan Approximation of the conditional number of exceedances 10 / 16

slide-25
SLIDE 25

Generator interpretation

If we set g(w) = h(w) − h(w − 1), the equation becomes:

Han Liang Gan Approximation of the conditional number of exceedances 11 / 16

slide-26
SLIDE 26

Generator interpretation

If we set g(w) = h(w) − h(w − 1), the equation becomes: E

  • λ (h(W + 1) − h(W )) − W (h(W ) − h(W − 1))1{W ≥2}
  • .

Han Liang Gan Approximation of the conditional number of exceedances 11 / 16

slide-27
SLIDE 27

Generator interpretation

If we set g(w) = h(w) − h(w − 1), the equation becomes: E

  • λ (h(W + 1) − h(W )) − W (h(W ) − h(W − 1))1{W ≥2}
  • .

This looks like the generator for a immigration death process.

Han Liang Gan Approximation of the conditional number of exceedances 11 / 16

slide-28
SLIDE 28

Generator interpretation

If we set g(w) = h(w) − h(w − 1), the equation becomes: E

  • λ (h(W + 1) − h(W )) − W (h(W ) − h(W − 1))1{W ≥2}
  • .

This looks like the generator for a immigration death process. Moreover, the stationary distribution for this generator is Po1(λ).

Han Liang Gan Approximation of the conditional number of exceedances 11 / 16

slide-29
SLIDE 29

Stein Factors

We can use theorem 2.10 from Brown & Xia (2001) to get:

Han Liang Gan Approximation of the conditional number of exceedances 12 / 16

slide-30
SLIDE 30

Stein Factors

We can use theorem 2.10 from Brown & Xia (2001) to get:

Theorem

The solution g that satisfies the Stein Equation for the total variation distance satisfies: ||∆g|| ≤ 1 − e−λ − λe−λ λ(1 − e−λ) .

Han Liang Gan Approximation of the conditional number of exceedances 12 / 16

slide-31
SLIDE 31

The example revisited

Han Liang Gan Approximation of the conditional number of exceedances 13 / 16

slide-32
SLIDE 32

The example revisited

Recall that from before: dTV (L(N1), Po1(λ)) = p + o(p).

Han Liang Gan Approximation of the conditional number of exceedances 13 / 16

slide-33
SLIDE 33

The example revisited

Recall that from before: dTV (L(N1), Po1(λ)) = p + o(p). Using Stein’s method directly for conditional Poisson approximation, it can be shown that: dTV (L(N1), Po1(λ∗)) = p 2 + o(p).

Han Liang Gan Approximation of the conditional number of exceedances 13 / 16

slide-34
SLIDE 34

Generalisations

The conditional Poisson Stein Identity generalises for conditioning on multiple exceedances:

Han Liang Gan Approximation of the conditional number of exceedances 14 / 16

slide-35
SLIDE 35

Generalisations

The conditional Poisson Stein Identity generalises for conditioning on multiple exceedances:

Lemma

W ∼ Poa(λ) if and only if for all bounded functions g : {a, a + 1, . . .} → R, E

  • λg(W + 1) − Wg(W ) · 1{W >a}
  • = 0.

Han Liang Gan Approximation of the conditional number of exceedances 14 / 16

slide-36
SLIDE 36

Negative Binomial Approximation

We can do exactly the same for negative binomial random variables.

Lemma

W ∼ Nba(r, p) if and only if for all bounded functions g : {a, a + 1, . . .} → R, E

  • (1 − p)(r + W )g(W ) − Wg(W )) · 1{W >a}
  • = 0.

Han Liang Gan Approximation of the conditional number of exceedances 15 / 16

slide-37
SLIDE 37

Different metrics

Have we solved our original problem? Can we calculate errors when estimating fragility indicies?

Han Liang Gan Approximation of the conditional number of exceedances 16 / 16

slide-38
SLIDE 38

Different metrics

Have we solved our original problem? Can we calculate errors when estimating fragility indicies? No, we still have the uniform integrability problem.

Han Liang Gan Approximation of the conditional number of exceedances 16 / 16

slide-39
SLIDE 39

Different metrics

Have we solved our original problem? Can we calculate errors when estimating fragility indicies? No, we still have the uniform integrability problem. We need to use a stronger metric, such as the Wasserstein distance.

Han Liang Gan Approximation of the conditional number of exceedances 16 / 16