Exponential functionals of Markov additive processes Anita Behme - - PowerPoint PPT Presentation

exponential functionals of markov additive processes
SMART_READER_LITE
LIVE PREVIEW

Exponential functionals of Markov additive processes Anita Behme - - PowerPoint PPT Presentation

Exponential functionals of Markov additive processes Anita Behme joint work in progress with Apostolos Sideris May 24th 2019 Probability and Analysis Overview Exponential functionals of L evy processes From L evy processes to


slide-1
SLIDE 1

Exponential functionals of Markov additive processes

Anita Behme joint work in progress with Apostolos Sideris May 24th 2019 Probability and Analysis

slide-2
SLIDE 2

Overview

◮ Exponential functionals of L´

evy processes

◮ From L´

evy processes to MAPs

◮ Exponential functionals of MAPs:

◮ Definition ◮ An example ◮ Main results and methodology ◮ Discussion and more results ◮ Open questions Anita Behme P&A 2019, 2

slide-3
SLIDE 3

Generalized Ornstein-Uhlenbeck processes

Let (ξt, ηt)t≥0 be a bivariate L´ evy process. The generalized Ornstein-Uhlenbeck (GOU) process (Vt)t≥0 driven by (ξ, η) is given by Vt = e−ξt

  • V0 +
  • (0,t]

eξs−dηs

  • ,

t ≥ 0, where V0 is a finite random variable, independent of (ξ, η).

Anita Behme P&A 2019, 3

slide-4
SLIDE 4

L´ evy processes

Definition: A L´ evy process in Rd on a probability space (Ω, F, P) is a stochastic process X = (Xt)t≥0, Xt : Ω → Rd satisfying the following properties:

◮ X0 = 0 a.s. ◮ X has independent increments, i.e. for all 0 ≤ t0 ≤ t1 ≤ . . . ≤ tn the

random variables Xt0, Xt1 − Xt0, . . . , Xtn − Xtn−1 are independent.

◮ X has stationary increments, i.e. for all s, t ≥ 0 it holds

Xs+t − Xs

d

= Xt.

◮ X has a.s. c`

adl` ag paths, i.e. for P-a.e. ω ∈ Ω the path t → Xt(ω) is right-continuous in t ≥ 0 and has left limits in t > 0.

Anita Behme P&A 2019, 4

slide-5
SLIDE 5

L´ evy processes

Definition: A L´ evy process in Rd on a probability space (Ω, F, P) is a stochastic process X = (Xt)t≥0, Xt : Ω → Rd satisfying the following properties:

◮ X0 = 0 a.s. ◮ X has independent increments, i.e. for all 0 ≤ t0 ≤ t1 ≤ . . . ≤ tn the

random variables Xt0, Xt1 − Xt0, . . . , Xtn − Xtn−1 are independent.

◮ X has stationary increments, i.e. for all s, t ≥ 0 it holds

Xs+t − Xs

d

= Xt.

◮ X has a.s. c`

adl` ag paths, i.e. for P-a.e. ω ∈ Ω the path t → Xt(ω) is right-continuous in t ≥ 0 and has left limits in t > 0. A L´ evy process X is uniquely determined by its characteristic triplet (γX, σX, νX).

Anita Behme P&A 2019, 4

slide-6
SLIDE 6

Exponential functionals

Theorem (Lindner, Maller ’05): The GOU process Vt = e−ξt

  • V0 +

t eξs−dηs

  • ,

t ≥ 0, solving dVt = Vt−dUt + dLt, with

◮ ξt = − log(E(U)t) ◮ (U, L) (or similarly (ξ, η)) bivariate L´

evy processes

◮ V0 starting random variable independent of (ξ, η)

has a (nontrivial) stationary distribution if and only if the integral V∞ := ∞ e−ξt−dLt converges a.s.

Anita Behme P&A 2019, 5

slide-7
SLIDE 7

Exponential functionals

Theorem (Lindner, Maller ’05): The GOU process Vt = e−ξt

  • V0 +

t eξs−dηs

  • ,

t ≥ 0, solving dVt = Vt−dUt + dLt, with

◮ ξt = − log(E(U)t) ◮ (U, L) (or similarly (ξ, η)) bivariate L´

evy processes

◮ V0 starting random variable independent of (ξ, η)

has a (nontrivial) stationary distribution if and only if the integral V∞ := ∞ e−ξt−dLt converges a.s. The stationary distribution is given by the law of the so-called exponential functional V∞.

Anita Behme P&A 2019, 5

slide-8
SLIDE 8

Exponential functionals

Erickson and Maller (2005) proposed necessary and sufficient conditions for convergence of V∞ := ∞ e−ξt−dηt. Mainly one needs:

◮ ξ tends to infinity ◮ η has a finite log+-moment

Anita Behme P&A 2019, 6

slide-9
SLIDE 9

Convergence of exponential functionals

Precisely, they stated Theorem (Erickson, Maller ’05): V∞ exists as a.s. limit as t → ∞ of t

0 e−ξs−dηs if and only if

lim

t→∞ ξt = ∞ a.s. and

Iξ,η =

  • (ea,∞)
  • log y

Aξ(log y)

νη(dy)| < ∞, where Aξ(x) = γξ + ¯ ν+

ξ (1) +

x

1

¯ ν+

ξ (y)dy,

with ¯ ν+

ξ (x) = νξ((x, ∞)),

¯ ν−

ξ (x) = νξ((−∞, −x)),

¯ νξ(x) = ¯ ν+

ξ (x)+¯

ν−

ξ (x),

and ¯ ν+

η , ¯

ν−

η and ¯

νη defined likewise. Hereby a > 0 is chosen such that Aξ(x) > 0 for all x > 0 and its existence is guaranteed whenever limt→∞ ξt = ∞ a.s.

Anita Behme P&A 2019, 7

slide-10
SLIDE 10

Convergence of exponential functionals

Further: Theorem (Erickson, Maller ’05, continued): If limt→∞ ξt = ∞ a.s. but Iξ,η = ∞, then

  • t

e−ξs−dηs

  • P

− → ∞, (1) while for limt→∞ ξt = −∞ or oscillating ξ either (1) holds, or there exists some k ∈ R \ {0} such that t e−ξs−dηs = k(1 − e−ξt) for all t > 0 a.s.

Anita Behme P&A 2019, 8

slide-11
SLIDE 11

Markov additive processes (MAPs)

Anita Behme P&A 2019, 9

slide-12
SLIDE 12

Markov additive processes (MAPs)

(ξt, ηt, Jt)t≥0 is a (bivariate) MAP with

◮ Markovian component (Jt)t≥0: Right-continuous, ergodic,

continuous time Markov chain with countable state space S, intensity matrix Q and stationary law π.

Anita Behme P&A 2019, 9

slide-13
SLIDE 13

Markov additive processes (MAPs)

(ξt, ηt, Jt)t≥0 is a (bivariate) MAP with

◮ Markovian component (Jt)t≥0: Right-continuous, ergodic,

continuous time Markov chain with countable state space S, intensity matrix Q and stationary law π.

◮ Additive component (ξt, ηt)t≥0:

(ξt, ηt) := (X (1)

t

, Y (1)

t

) + (X (2)

t

, Y (2)

t

), t ≥ 0.

◮ (X (1)

t

, Y (1)

t

) behaves in law like a bivariate L´ evy process (ξ(j)

t , η(j) t ) whenever Jt = j,

◮ (X (2)

t

, Y (2)

t

) is a pure jump process given by (X (2)

t

, Y (2)

t

) =

  • n≥1
  • i,j∈S

Z (i,j)

n

1{JTn−=i,JTn =j,Tn≤t}, for i.i.d. random variables Z (i,j)

n

in R2.

Anita Behme P&A 2019, 9

slide-14
SLIDE 14

Markov additive processes (MAPs)

(ξt, ηt, Jt)t≥0 is a (bivariate) MAP with

◮ Markovian component (Jt)t≥0: Right-continuous, ergodic,

continuous time Markov chain with countable state space S, intensity matrix Q and stationary law π.

◮ Additive component (ξt, ηt)t≥0:

(ξt, ηt) := (X (1)

t

, Y (1)

t

) + (X (2)

t

, Y (2)

t

), t ≥ 0.

◮ (X (1)

t

, Y (1)

t

) behaves in law like a bivariate L´ evy process (ξ(j)

t , η(j) t ) whenever Jt = j,

◮ (X (2)

t

, Y (2)

t

) is a pure jump process given by (X (2)

t

, Y (2)

t

) =

  • n≥1
  • i,j∈S

Z (i,j)

n

1{JTn−=i,JTn =j,Tn≤t}, for i.i.d. random variables Z (i,j)

n

in R2. As starting value under Pj we use (ξ0, η0, J0) = (0, 0, j). Throughout neither ξ nor η is degenerate constantly equal to 0.

Anita Behme P&A 2019, 9

slide-15
SLIDE 15

Special cases of MAPs

◮ S = {0}: (bivariate) L´

evy process

Anita Behme P&A 2019, 10

slide-16
SLIDE 16

Special cases of MAPs

◮ S = {0}: (bivariate) L´

evy process

◮ (X (1)

t

, Y (1)

t

) ≡ 0: (bivariate) continuous-time Markov chain in R2

Anita Behme P&A 2019, 10

slide-17
SLIDE 17

Special cases of MAPs

◮ S = {0}: (bivariate) L´

evy process

◮ (X (1)

t

, Y (1)

t

) ≡ 0: (bivariate) continuous-time Markov chain in R2

◮ (X (2)

t

, Y (2)

t

) ≡ 0: no common jumps of (Jt)t≥0 and (ξt, ηt)t≥0:

2 4 6 8 10 0.0 0.5 1.0 1.5 t X_t(omega)

Anita Behme P&A 2019, 10

slide-18
SLIDE 18

Exponential functionals of MAPs

Anita Behme P&A 2019, 11

slide-19
SLIDE 19

Exponential functionals of MAPs

Given a bivariate Markov additive process (ξt, ηt, Jt)t≥0 with Markovian component (Jt)t≥0, we denote E(t) := E(ξ,η)(t) :=

  • (0,t]

e−ξs−dηs, 0 < t < ∞. Literature: Some recent results on E for ηt = t on arXiv (Salminen et al./Stephenson)

Anita Behme P&A 2019, 11

slide-20
SLIDE 20

An example1

◮ S = N0 ◮ (Jt)t≥0 continuous time petal flower

Markov chain with intensity matrix Q = (qi,j)i,j∈N0 =      −q q0,1 q0,2 . . . q −q . . . q −q . . . . . . ...      for q > 0 fixed and q0,j = qp0,j j ∈ N. (Jt)t≥0 is irreducible, recurrent with stationary distribution π0 = 1 2, and πj = p0,j 2 = q0,j 2q , j ∈ N

1Thanks to Gerold Alsmeyer for the picture! Anita Behme P&A 2019, 12

slide-21
SLIDE 21

An example

Now choose ξ and η to be conditionally independent with ξt = X (2)

t

=

  • n≥1
  • i,j∈N0

Z (i,j)

n

1{JTn−=i,JTn =j,Tn≤t}, Z (i,j)

n

:=      −p−1

0,j ,

i = 0, 2 + p−1

0,i ,

j = 0, 0, else. Then ξτn(0) = 2n → ∞ P0-a.s. but lim inf

t→∞ ξt = −∞.

Thus ξ is oscillating.

Anita Behme P&A 2019, 13

slide-22
SLIDE 22

An example

Now choose ξ and η to be conditionally independent with ξt = X (2)

t

=

  • n≥1
  • i,j∈N0

Z (i,j)

n

1{JTn−=i,JTn =j,Tn≤t}, Z (i,j)

n

:=      −p−1

0,j ,

i = 0, 2 + p−1

0,i ,

j = 0, 0, else. Then ξτn(0) = 2n → ∞ P0-a.s. but lim inf

t→∞ ξt = −∞.

Thus ξ is oscillating. Choosing ηt =

  • (0,t] γη(Js )ds with γη(j) =
  • 1,

j = 0, 0,

  • therwise,

we observe under P0

  • (0,t]

e−ξs−dηs =

  • (0,t]

e−ξs−γη(Js )ds =

  • (0,t]

e−Ns−1{Js=0}ds.

Anita Behme P&A 2019, 13

slide-23
SLIDE 23

An example

Now choose ξ and η to be conditionally independent with ξt = X (2)

t

=

  • n≥1
  • i,j∈N0

Z (i,j)

n

1{JTn−=i,JTn =j,Tn≤t}, Z (i,j)

n

:=      −p−1

0,j ,

i = 0, 2 + p−1

0,i ,

j = 0, 0, else. Then ξτn(0) = 2n → ∞ P0-a.s. but lim inf

t→∞ ξt = −∞.

Thus ξ is oscillating. Choosing ηt =

  • (0,t] γη(Js )ds with γη(j) =
  • 1,

j = 0, 0,

  • therwise,

we observe under P0

  • (0,t]

e−ξs−dηs =

  • (0,t]

e−ξs−γη(Js )ds =

  • (0,t]

e−Ns−1{Js=0}ds. I.e. the exponential functional converges P0-a.s. as t → ∞.

Anita Behme P&A 2019, 13

slide-24
SLIDE 24

An example

Now choose ξ and η to be conditionally independent with ξt = X (2)

t

=

  • n≥1
  • i,j∈N0

Z (i,j)

n

1{JTn−=i,JTn =j,Tn≤t}, Z (i,j)

n

:=      −p−1

0,j ,

i = 0, 2 + p−1

0,i ,

j = 0, 0, else. Then ξτn(0) = 2n → ∞ P0-a.s. but lim inf

t→∞ ξt = −∞.

Thus ξ is oscillating. Choosing ηt =

  • (0,t] γη(Js )ds with γη(j) =
  • 1,

j = 0, 0,

  • therwise,

we observe under P0

  • (0,t]

e−ξs−dηs =

  • (0,t]

e−ξs−γη(Js )ds =

  • (0,t]

e−Ns−1{Js=0}ds. I.e. the exponential functional converges P0-a.s. as t → ∞.

Anita Behme P&A 2019, 13

slide-25
SLIDE 25

Methodology

Anita Behme P&A 2019, 14

slide-26
SLIDE 26

Methodology

L´ evy case (Erickson & Maller ’05): The exponential functional

  • (0,∞)

e−ξt−dηt, can be discretized for any h > 0 as:

  • (0,nh]

e−ξs−dηs =

n−1

  • i=0
  • (ih,(i+1)h]

e−ξs−dηs =

n−1

  • i=0

 

i−1

  • j=0

e−(ξ(j+1)h−ξjh)  

  • (ih,(i+1)h]

e−(ξs−−ξih)dηs, Thus: Convergence of the integral is strongly connected to convergence

  • f discrete-time perpetuities as studied by Goldie & Maller (2000).

Anita Behme P&A 2019, 14

slide-27
SLIDE 27

Methodology II

Alsmeyer & Buckmann (2017) generalized the results from Goldie & Maller (2000) to a Markovian environment:

Anita Behme P&A 2019, 15

slide-28
SLIDE 28

Methodology II

Alsmeyer & Buckmann (2017) generalized the results from Goldie & Maller (2000) to a Markovian environment: They provide necessary and sufficient conditions for convergence as n → ∞ of Zn :=

n

  • i=1

 

i−1

  • j=1

Aj   Bi, where

◮ (An, Bn)n∈N, sequence of random vectors in R2, modulated by ◮ (Mn)n∈N0, ergodic Markov chain with countable state space S and

stationary law π.

Anita Behme P&A 2019, 15

slide-29
SLIDE 29

Methodology II

Alsmeyer & Buckmann (2017) generalized the results from Goldie & Maller (2000) to a Markovian environment: They provide necessary and sufficient conditions for convergence as n → ∞ of Zn :=

n

  • i=1

 

i−1

  • j=1

Aj   Bi, where

◮ (An, Bn)n∈N, sequence of random vectors in R2, modulated by ◮ (Mn)n∈N0, ergodic Markov chain with countable state space S and

stationary law π. ”Modulated” in the sense that

◮ conditionally on Mn = in ∈ S, n = 0, 1, 2, . . . the random vectors

(A1, B1), (A2, B2), . . . are independent, and

◮ for all n ∈ N the conditional law of (An, Bn) is temporally

homogeneous and depends only on (in−1, in) ∈ S2.

Anita Behme P&A 2019, 15

slide-30
SLIDE 30

Methodology III

We shall

◮ find ”good” discretizations of Eξ,η(t) and ◮ apply/extend Alsmeyer & Buckmanns results/techniques,

to obtain necessary and/or sufficient conditions for convergence of Eξ,η(t) as t → ∞.

Anita Behme P&A 2019, 16

slide-31
SLIDE 31

Results

Define Tj := {t ≥ 0 : Jt = t}, and τ1(j) := first return time to j, τ −

1 (j) := first exit time of j.

Main Theorem (B&Sideris, ’19):

Anita Behme P&A 2019, 17

slide-32
SLIDE 32

Results

Define Tj := {t ≥ 0 : Jt = t}, and τ1(j) := first return time to j, τ −

1 (j) := first exit time of j.

Main Theorem (B&Sideris, ’19): (i) Assume that limt∈Tj,t→∞ ξt = ∞ for some/all j ∈ S and that

  • (1,∞)

log q

  • (0,log q] Pj(ξτ1(j) > u)du Pj
  • sup

0≤t≤τ1(j)

  • t

e−ξs−dηs

  • ∈ dq
  • < ∞,

for some/all j ∈ S, then E(ξ,η)(t) → E∞

(ξ,η) Pπ-a.s. as t → ∞ for some

random variable E∞

(ξ,η).

Anita Behme P&A 2019, 17

slide-33
SLIDE 33

Results

Define Tj := {t ≥ 0 : Jt = t}, and τ1(j) := first return time to j, τ −

1 (j) := first exit time of j.

Main Theorem (B&Sideris, ’19): (ii) If limt∈Tj,t→∞ ξt = ∞ for some j ∈ S and

  • (1,∞)

log q

  • (0,log q] Pj(ξτ1(j) > u)du Pj
  • (τ−

1 (j),τ1(j)]

e−ξs−dηs + Y b,η

τ−

1 (j)

  • ∈ dq
  • < ∞,

(2)

then there exists a probability measure Qj = Pj(E∞

(ξ,η) ∈ ·) on R, such that

E(ξ,η)(t) → E∞

(ξ,η) in Pj-probability.

Anita Behme P&A 2019, 17

slide-34
SLIDE 34

Results

Define Tj := {t ≥ 0 : Jt = t}, and τ1(j) := first return time to j, τ −

1 (j) := first exit time of j.

Main Theorem (B&Sideris, ’19): (iii) If lim inft∈Tj,t→∞ ξt < ∞ for some j ∈ S , then either there exists a (unique) sequence {ci, i ∈ S} in R such that E(ξ,η)(t) =

  • (0,t]

e−ξs−dηs = cJ0 − cJte−ξt Pπ-a.s. for all t ≥ 0, or |E(ξ,η)(t)| → ∞ in Pπ-probability.

Anita Behme P&A 2019, 17

slide-35
SLIDE 35

Results

Define Tj := {t ≥ 0 : Jt = t}, and τ1(j) := first return time to j, τ −

1 (j) := first exit time of j.

Main Theorem (B&Sideris, ’19): (iii) If lim inft∈Tj,t→∞ ξt < ∞ for some j ∈ S (or if (2) fails(?)), then either there exists a (unique) sequence {ci, i ∈ S} in R such that E(ξ,η)(t) =

  • (0,t]

e−ξs−dηs = cJ0 − cJte−ξt Pπ-a.s. for all t ≥ 0, or |E(ξ,η)(t)| → ∞ in Pπ-probability.

Anita Behme P&A 2019, 17

slide-36
SLIDE 36

Degeneracy

Anita Behme P&A 2019, 18

slide-37
SLIDE 37

Degeneracy

Recall: Degeneracy in the L´ evy case S = {1} is characterized by P t e−ξs−dηs = k(1 − e−ξt) for all t > 0

  • = 1

Anita Behme P&A 2019, 18

slide-38
SLIDE 38

Degeneracy

Recall: Degeneracy in the L´ evy case S = {1} is characterized by P t e−ξs−dηs = k(1 − e−ξt) for all t > 0

  • = 1

For Eξ,η we observe: Eξ,η is degenerate iff there exists a (unique) sequence {ci, i ∈ S} in R such that E(ξ,η)(t) =

  • (0,t]

e−ξs−dηs = cJ0 − cJte−ξt Pπ-a.s. for all t ≥ 0. (3)

Anita Behme P&A 2019, 18

slide-39
SLIDE 39

Degeneracy

Recall: Degeneracy in the L´ evy case S = {1} is characterized by P t e−ξs−dηs = k(1 − e−ξt) for all t > 0

  • = 1

For Eξ,η we observe: Eξ,η is degenerate iff there exists a (unique) sequence {ci, i ∈ S} in R such that E(ξ,η)(t) =

  • (0,t]

e−ξs−dηs = cJ0 − cJte−ξt Pπ-a.s. for all t ≥ 0. (3) Further: Proposition (B&Sideris, ’19+) Assume (3) holds for all t ≥ 0 and some sequence {ci, i ∈ S}. Then ηt = −

  • (0,t]

cJs−dUs −

  • (0,t]

dcJs, t ≥ 0, Pπ-a.s. (4) where (Ut)t≥0 = (Log (e−ξt))t≥0. Conversely, if (4) holds for some sequence {ci, i ∈ S}, then (3) is fulfilled for all t ≥ 0.

Anita Behme P&A 2019, 18

slide-40
SLIDE 40

Degeneracy, continued

ηt = −

  • (0,t]

cJs−dUs −

  • (0,t]

dcJs, t ≥ 0, Pπ-a.s. implies

Anita Behme P&A 2019, 19

slide-41
SLIDE 41

Degeneracy, continued

ηt = −

  • (0,t]

cJs−dUs −

  • (0,t]

dcJs, t ≥ 0, Pπ-a.s. implies

◮ If (X (2)

t

, Y (2)

t

) ≡ 0 (that is ∆ξTn = 0 = ∆ηTn Pπ-a.s. for all n), then ci ≡ c, i.e. ηt = −cUt and E(ξ,η)(t) =

  • (0,t]

e−ξs−dηs = c(1 − e−ξt) Pπ-a.s. for all t ≥ 0.

Anita Behme P&A 2019, 19

slide-42
SLIDE 42

Degeneracy, continued

ηt = −

  • (0,t]

cJs−dUs −

  • (0,t]

dcJs, t ≥ 0, Pπ-a.s. implies

◮ If (X (2)

t

, Y (2)

t

) ≡ 0 (that is ∆ξTn = 0 = ∆ηTn Pπ-a.s. for all n), then ci ≡ c, i.e. ηt = −cUt and E(ξ,η)(t) =

  • (0,t]

e−ξs−dηs = c(1 − e−ξt) Pπ-a.s. for all t ≥ 0.

◮ If ∆ξTn = 0 Pπ-a.s. for all n, then Z (i,j)

η

= ci − cj.

Anita Behme P&A 2019, 19

slide-43
SLIDE 43

Degeneracy, continued

ηt = −

  • (0,t]

cJs−dUs −

  • (0,t]

dcJs, t ≥ 0, Pπ-a.s. implies

◮ If (X (2)

t

, Y (2)

t

) ≡ 0 (that is ∆ξTn = 0 = ∆ηTn Pπ-a.s. for all n), then ci ≡ c, i.e. ηt = −cUt and E(ξ,η)(t) =

  • (0,t]

e−ξs−dηs = c(1 − e−ξt) Pπ-a.s. for all t ≥ 0.

◮ If ∆ξTn = 0 Pπ-a.s. for all n, then Z (i,j)

η

= ci − cj.

◮ If ∆ηTn = 0 Pπ-a.s. for all n, then Z (i,j)

ξ

= log cj

ci .

Anita Behme P&A 2019, 19

slide-44
SLIDE 44

Although we can state necessary and sufficient conditions for convergence of E(ξ,η)(t), these are hardly applicable.

Anita Behme P&A 2019, 20

slide-45
SLIDE 45

Splitting

To obtain easier (sufficient) conditions, we split the exponential functional in two pieces: E(ξ,η)(t) =

  • (0,t]

e−ξs−d(γη

s + W η s + Y b,η s

+ Y s,η

s

+ Y (2)

s

) =

  • (0,t]

e−ξs−d( γη

s

  • drift

+ W η

s + Y s,η s

  • martingale part

) +

  • (0,t]

e−ξs−d(Y b,η

s

+ Y (2)

s

  • ”big” jumps

) =: E(1)(t) + E(2)(t).

Anita Behme P&A 2019, 21

slide-46
SLIDE 46

Splitting

To obtain easier (sufficient) conditions, we split the exponential functional in two pieces: E(ξ,η)(t) =

  • (0,t]

e−ξs−d(γη

s + W η s + Y b,η s

+ Y s,η

s

+ Y (2)

s

) =

  • (0,t]

e−ξs−d( γη

s

  • drift

+ W η

s + Y s,η s

  • martingale part

) +

  • (0,t]

e−ξs−d(Y b,η

s

+ Y (2)

s

  • ”big” jumps

) =: E(1)(t) + E(2)(t).

◮ E(1)(t) converges a.s. under rather weak conditions.

Anita Behme P&A 2019, 21

slide-47
SLIDE 47

Splitting

To obtain easier (sufficient) conditions, we split the exponential functional in two pieces: E(ξ,η)(t) =

  • (0,t]

e−ξs−d(γη

s + W η s + Y b,η s

+ Y s,η

s

+ Y (2)

s

) =

  • (0,t]

e−ξs−d( γη

s

  • drift

+ W η

s + Y s,η s

  • martingale part

) +

  • (0,t]

e−ξs−d(Y b,η

s

+ Y (2)

s

  • ”big” jumps

) =: E(1)(t) + E(2)(t).

◮ E(1)(t) converges a.s. under rather weak conditions. ◮ E(2)(t) can be embedded in a discrete time setting and directly

corresponds to a Markov modulated perpetuity.

Anita Behme P&A 2019, 21

slide-48
SLIDE 48

The characteristic κξ

Recall: L´ evy processes in R either drift to ±∞ or oscillate.

Anita Behme P&A 2019, 22

slide-49
SLIDE 49

The characteristic κξ

Recall: L´ evy processes in R either drift to ±∞ or oscillate. MAPs often show a similar behaviour: Define the long-term mean (here for the MAP (ξt, Jt)t≥0) κξ :=

  • j∈S

πj

  • γξ(j) +
  • |x|≥1

xνξ(j)(dx)

  • +
  • (i,j)∈S×S

i=j

πiqi,j

  • R

xF (i,j)

ξ

(dx). Whenever S is finite, κξ fully determines the long-term behaviour of ξ: κξ > 0 ⇒ lim

t→∞ ξt = ∞ Pπ-a.s.,

κξ < 0 ⇒ lim

t→∞ ξt = −∞ Pπ-a.s.,

while κξ = 0 and Pπ

  • supt≥0 |ξt| < ∞
  • < 1

lim supt→∞ ξt = ∞ and lim inft→∞ ξt = −∞

  • Pπ-a.s.

Anita Behme P&A 2019, 22

slide-50
SLIDE 50

On E(1)

Proposition (B&Sideris, ’19): Assume that 0 < κξ < ∞ and sup

j∈S

  • |γη(j)| + σ2

η(j) +

  • (0,1)

x2νη(j)(dx)

  • < ∞.

(5) Then E(1)(t) converges Pπ-a.s. to a finite random variable as t → ∞.

Anita Behme P&A 2019, 23

slide-51
SLIDE 51

On E(1)

Proposition (B&Sideris, ’19): Assume that 0 < κξ < ∞ and sup

j∈S

  • |γη(j)| + σ2

η(j) +

  • (0,1)

x2νη(j)(dx)

  • < ∞.

(5) Then E(1)(t) converges Pπ-a.s. to a finite random variable as t → ∞. Note that

◮ For S finite, (5) is always fulfilled.

Anita Behme P&A 2019, 23

slide-52
SLIDE 52

On E(1)

Proposition (B&Sideris, ’19): Assume that 0 < κξ < ∞ and sup

j∈S

  • |γη(j)| + σ2

η(j) +

  • (0,1)

x2νη(j)(dx)

  • < ∞.

(5) Then E(1)(t) converges Pπ-a.s. to a finite random variable as t → ∞. Note that

◮ For S finite, (5) is always fulfilled. ◮ In general (5) is necessary.

Anita Behme P&A 2019, 23

slide-53
SLIDE 53

A result for E(2)

Proposition (B&Sideris, ’19): Assume 0 < κξ < ∞.

  • 1. E(2)(t) converges Pπ-a.s. to a finite random variable as t → ∞ if

and only if for some/all j ∈ S

  • (1,∞)

log q Pj

  • sup

0<t≤τ1(j)

e−ξt−|∆(Y b,η

t

+ Y (2)

t

)| ∈ dq

  • < ∞.
  • 2. E(2)(t) converges in Pj-probability to some random variable E(2)

∞ for

all j ∈ S, if and only if for some/all j ∈ S

  • (1,∞)

log q Pj

  • (0,τ1(i)]

e−ξt−d(Y b,η

t

+ Y (2)

t

)

  • ∈ dq
  • < ∞.

Anita Behme P&A 2019, 24

slide-54
SLIDE 54

Open questions/Outlook

Anita Behme P&A 2019, 25

slide-55
SLIDE 55

Open questions/Outlook

◮ Fluctuation theory for MAPs with countable state space?

Anita Behme P&A 2019, 25

slide-56
SLIDE 56

Open questions/Outlook

◮ Fluctuation theory for MAPs with countable state space? ◮ E as stationary distribution of a Markov modulated generalized

Ornstein-Uhlenbeck process?

Anita Behme P&A 2019, 25

slide-57
SLIDE 57

Thank you for your attention!

Anita Behme P&A 2019, 26

slide-58
SLIDE 58

Main References

◮ K. B. Erickson and R. A. Maller (2005)

Generalised Ornstein-Uhlenbeck processes and the convergence of L´ evy integrals. S´ eminaire de Probabilit´ es XXXVIII.

◮ G. Alsmeyer and F. Buckmann (2017)

Stability of perpetuities in Markovian environment.

  • J. Difference Equ. Appl.

◮ A. Behme and A. Sideris (2019+)

Exponential functionals of Markov additive processes (working title). To be submitted soon.

Anita Behme P&A 2019, 27