A Strong Uniform Approximation of FBM by Means of Transport - - PowerPoint PPT Presentation

a strong uniform approximation of fbm by means of
SMART_READER_LITE
LIVE PREVIEW

A Strong Uniform Approximation of FBM by Means of Transport - - PowerPoint PPT Presentation

A Strong Uniform Approximation of FBM by Means of Transport Processes Jorge A. Len Departamento de Control Automtico Cinvestav del IPN Spring School Stochastic Control in Finance, Roscoff 2010 Jointly with Johanna Garzn Merchn


slide-1
SLIDE 1

A Strong Uniform Approximation of FBM by Means of Transport Processes

Jorge A. León

Departamento de Control Automático Cinvestav del IPN

Spring School “Stochastic Control in Finance”, Roscoff 2010

Jointly with Johanna Garzón Merchán and Luis G. Gorostiza

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 1 / 82

slide-2
SLIDE 2

Contents

1

Some Approximations of FBM

2

Transport Processes

3

Approximation of FBM by Means of Transport Processes

4

Approximatios of Fractional Stochastic Differential Equations

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 2 / 82

slide-3
SLIDE 3

Contents

1

Some Approximations of FBM

2

Transport Processes

3

Approximation of FBM by Means of Transport Processes

4

Approximatios of Fractional Stochastic Differential Equations

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 3 / 82

slide-4
SLIDE 4

Taqqu 1975

Let {Yi} be a sequence of stationary Gaussian random variables such that

n

  • i=1

n

  • j=1

E(YiYj) ∼ An2HL(n) as n → ∞.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 4 / 82

slide-5
SLIDE 5

Taqqu 1975

Let {Yi} be a sequence of stationary Gaussian random variables such that

n

  • i=1

n

  • j=1

E(YiYj) ∼ An2HL(n) as n → ∞. Here 0 < H < 1, A > 0 and L is a slowly varying function (i.e., for all a > 0, limx→∞

L(ax) L(x) = 1).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 5 / 82

slide-6
SLIDE 6

Taqqu 1975

Let {Yi} be a sequence of stationary Gaussian random variables such that

n

  • i=1

n

  • j=1

E(YiYj) ∼ An2HL(n) as n → ∞. Here 0 < H < 1, A > 0 and L is a slowly varying function Then Xn(t) = 1 dn

⌊nt⌋

  • i=1

Yi converges weakly to √ ABH

t , where d2 n ∼ n2HL(n).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 6 / 82

slide-7
SLIDE 7

Tommi Sottinen 2001

Let {ξi : i > 0} be a sequence of i.i.d. random variables with E[ξi] = 0 and Var[ξi] = 1, and B(n)

t

=

⌊nt⌋

  • i=1
  • n
  • i

n i−1 n

KH

⌊nt⌋

n , s

  • ds

1

√nξi.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 7 / 82

slide-8
SLIDE 8

Tommi Sottinen 2001

Let {ξi : i > 0} be a sequence of i.i.d. random variables with E[ξi] = 0 and Var[ξi] = 1, and B(n)

t

=

⌊nt⌋

  • i=1
  • n
  • i

n i−1 n

KH

⌊nt⌋

n , s

  • ds

1

√nξi. Here, H < 1/2 and KH(t, s) = dH

  • (t

s )H− 1

2(t − s)H− 1 2

−(H − 1 2)s

1 2 −H

t

s uH− 3

2(u − s)H− 1 2du

  • Jorge A. León (Cinvestav–IPN)

A strong uniform approximation Roscoff 2010 8 / 82

slide-9
SLIDE 9

Tommi Sottinen 2001

Let {ξi : i > 0} be a sequence of i.i.d. random variables with E[ξi] = 0 and Var[ξi] = 1, and B(n)

t

=

⌊nt⌋

  • i=1
  • n
  • i

n i−1 n

KH

⌊nt⌋

n , s

  • ds

1

√nξi. Here, H < 1/2 and KH(t, s) = dH

  • (t

s )H− 1

2(t − s)H− 1 2

−(H − 1 2)s

1 2 −H

t

s uH− 3

2(u − s)H− 1 2du

  • Then B(n) goes weakly to BH.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 9 / 82

slide-10
SLIDE 10

Stroock 1982

The family Zǫ :=

  • Zǫ(t) = 1

ǫ

t

0 (−1)N( s

ǫ2 )ds, t ∈ [0, T]

  • converges weakly to the Brownian motion, as ǫ → 0.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 10 / 82

slide-11
SLIDE 11

Stroock 1982

The family Zǫ :=

  • Zǫ(t) = 1

ǫ

t

0 (−1)N( s

ǫ2 )ds, t ∈ [0, T]

  • converges weakly to the Brownian motion, as ǫ → 0.

Here {N(t), t ≥ 0} is a Poisson process

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 11 / 82

slide-12
SLIDE 12

Delgado y Jolis (2000)

The family Xǫ :=

  • Xǫ(t) = 1

ǫ

t

0 KH(t, s)(−1)N( s

ǫ2 )ds, t ∈ [0, T]

  • converges to BH, as ǫ → 0.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 12 / 82

slide-13
SLIDE 13

Delgado y Jolis (2000)

The family Xǫ :=

  • Xǫ(t) = 1

ǫ

t

0 KH(t, s)(−1)N( s

ǫ2 )ds, t ∈ [0, T]

  • converges to BH, as ǫ → 0.

Here KH(t, s) is given by : cHs

1 2 −H

t

s (u − s)H− 3

2uH− 1 2du

  • 1(0,t)(s),

H > 1 2,

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 13 / 82

slide-14
SLIDE 14

Delgado y Jolis (2000)

Xǫ :=

  • Xǫ(t) = 1

ǫ

t

0 KH(t, s)(−1)N( s

ǫ2 )ds, t ∈ [0, T]

  • converges to BH, as ǫ → 0.

Here KH(t, s) is given by : cHs

1 2 −H

t

s (u − s)H− 3

2uH− 1 2du

  • 1(0,t)(s),

H > 1 2, and dH

  • (t

s )H− 1

2(t − s)H− 1 2 − (H − 1

2)s

1 2 −H

t

s uH− 3

2(u − s)H− 1 2du

  • ,

for H < 1

2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 14 / 82

slide-15
SLIDE 15

Szabados (2001)

i.i.d r.v. random walks ∆t ∆x Modification X0(1), X0(2), · · · S0 = n

k=1 X0(k)

1 1 ˜ S0(n) X1(1), X1(2), · · · S1 =

n

k=1 X1(k)

2−2 2−1 ˜ S1(n) . . . . . . . . . . . . . . . Xm(1), Xm(2), · · · Sm = n

k=1 Xm(k)

2−2m 2−m ˜ Sm(n) P({Xn(k) = 1}) = P({Xn(k) = −1}) = 1 2. and Sm(t) = Sm( j 22n) + 22n(t − j 22n )Xm(j + 1), j 22n ≤ t < j + 1 22n , with Sm( j 22n ) =

j

  • i=1

Xm(i).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 15 / 82

slide-16
SLIDE 16

Szabados (2001)

i.i.d r.v. random walks ∆t ∆x Modification X0(1), X0(2), · · · S0 =

n

k=1 X0(k)

1 1 ˜ S0(n) X1(1), X1(2), · · · S1 = n

k=1 X1(k)

2−2 2−1 ˜ S1(n) . . . . . . . . . . . . . . . Xm(1), Xm(2), · · · Sm = n

k=1 Xm(k)

2−2m 2−m ˜ Sm(n) Set Bm(t) = 2−m˜ Sm(t22m)

Theorem

Bm → W as m → ∞ a.s. uniformly on compact sets.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 16 / 82

slide-17
SLIDE 17

Szabados (2001)

Bm(t) = 2−m˜ Sm(t22m) Set BH

m(tk) = k−1

  • r=−∞

h(tr, tk)[Bm(tr + ∆t) − Bm(tr)] and BH

m(0) = 0.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 17 / 82

slide-18
SLIDE 18

Szabados (2001)

Set BH

m(tk) = k−1

  • r=−∞

h(tr, tk)[Bm(tr + ∆t) − Bm(tr)], and BH

m(0) = 0,

with ∆t = 2−2m, tx = x∆t, x ∈ R, and h(s, t) = CH

  • (t − s)H−1/2 − (−s)H−1/2

+

  • ,

s ≤ t.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 18 / 82

slide-19
SLIDE 19

Szabados (2001)

Set BH

m(tk) = k−1

  • r=−∞

h(tr, tk)[Bm(tr + ∆t) − Bm(tr)], and BH

m(0) = 0,

with ∆t = 2−2m, tx = x∆t, x ∈ R, and h(s, t) = CH

  • (t − s)H−1/2 − (−s)H−1/2

+

  • ,

s ≤ t.

Theorem

For H ∈ (1/4, 1), BH

m → BH

as m → ∞ a.s. uniformly on compact sets.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 19 / 82

slide-20
SLIDE 20

Szabados (2001)

Set BH

m(tk) = k−1

  • r=−∞

h(tr, tk)[Bm(tr + ∆t) − Bm(tr)], and BH

m(0) = 0,

with ∆t = 2−2m, tx = x∆t, x ∈ R, and h(s, t) = CH

  • (t − s)H−1/2 − (−s)H−1/2

+

  • ,

s ≤ t.

Theorem

For H ∈ (1/4, 1), BH

m → BH

as m → ∞ a.s. uniformly on compact sets. The rate of convergence is O(n− min{H−1/4,1/4}2 log 2 log n).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 20 / 82

slide-21
SLIDE 21

Contents

1

Some Approximations of FBM

2

Transport Processes

3

Approximation of FBM by Means of Transport Processes

4

Approximatios of Fractional Stochastic Differential Equations

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 21 / 82

slide-22
SLIDE 22

Transport processes

  • X (n)(t), t ≥ 0
  • is a transport process iff :

X (n)(0) = 0,

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 22 / 82

slide-23
SLIDE 23

Transport processes

  • X (n)(t), t ≥ 0
  • is a transport process iff :

X (n)(0) = 0, X (n) is continuous,

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 23 / 82

slide-24
SLIDE 24

Transport processes

  • X (n)(t), t ≥ 0
  • is a transport process iff :

X (n)(0) = 0, X (n) is continuous, X (n) is a piecewise linear function with slopes ±n,

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 24 / 82

slide-25
SLIDE 25

Transport processes

  • X (n)(t), t ≥ 0
  • is a transport process iff :

X (n)(0) = 0, X (n) is continuous, X (n) is a piecewise linear function with slopes ±n, The slope at 0+ is random. It is n or −n with probability 1/2,

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 25 / 82

slide-26
SLIDE 26

Transport processes

  • X (n)(t), t ≥ 0
  • is a transport process iff :

X (n)(0) = 0, X (n) is continuous, X (n) is a piecewise linear function with slopes ±n, The slope at 0+ is random. It is n or −n with probability 1/2, The times between consecutive slope changes are independent and exponential distributed with parameter n2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 26 / 82

slide-27
SLIDE 27

Costruction of transport processes

We fix (Ω, F, P) y W = (Wt)t≥0.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 27 / 82

slide-28
SLIDE 28

Costruction of transport processes

We fix (Ω, F, P) y W = (Wt)t≥0. Consider, for each n > 0, : A family {ξn

i , i = 1, 2, . . .} i.i.d random variables, with

distribution exp(2n2), independent of W .

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 28 / 82

slide-29
SLIDE 29

Costruction of transport processes

We fix (Ω, F, P) y W = (Wt)t≥0. Consider, for each n > 0, : A family {ξn

i , i = 1, 2, . . .} i.i.d random variables, with

distribution exp(2n2), independent of W . A family {κi, i = 1, 2, . . .} of independent random variables, independent of ξn

i , i = 1, 2, . . . , and W , such that

P(κi = ±1) = 1/2

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 29 / 82

slide-30
SLIDE 30

Costruction of transport processes

We fix (Ω, F, P) y W = (Wt)t≥0. Consider, for each n > 0, : A family {ξn

i , i = 1, 2, . . .} i.i.d random variables, with

distribution exp(2n2), independent of W . A family {κi, i = 1, 2, . . .} of independent random variables, independent of ξn

i , i = 1, 2, . . . and W , such that

P(κi = ±1) = 1/2

Theorem (Skorohod)

There exists a family {σn

i , i = 1, 2, . . .} of independent and

nonegative random variables such that E

  • σn

j

  • =

1 2n2, σn 0 = 0 and

  W  

i

  • j=1

σn

j

  , i = 1, 2, . . .   

d

=

  

i

  • j=1

κjξn

j , i = 1, 2, . . .

  

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 30 / 82

slide-31
SLIDE 31

Costruction of transport processes

Theorem (Skorohod)

There exists a family {σn

i , i = 1, 2, . . .} of independent and

nonegative random variables such that E

  • σn

j

  • =

1 2n2, σn 0 = 0 and

  W  

i

  • j=1

σn

j

  , i = 1, 2, . . .   

d

=

  

i

  • j=1

κjξn

j , i = 1, 2, . . .

  

Set γn

i := 1

n

  • W

 

i

  • j=0

σn

j

  − W  

i−1

  • j=0

σn

j

 

  • d

=κiξn

i

.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 31 / 82

slide-32
SLIDE 32

Costruction of transport processes

Theorem (Skorohod)

There exists a family {σn

i , i = 1, 2, . . .} of independent and

nonegative random variables such that E

  • σn

j

  • =

1 2n2, σn 0 = 0 and

  W  

i

  • j=1

σn

j

  , i = 1, 2, . . .   

d

=

  

i

  • j=1

κjξn

j , i = 1, 2, . . .

  

Set γn

i := 1

n

  • W

 

i

  • j=0

σn

j

  − W  

i−1

  • j=0

σn

j

 

  • d

=κiξn

i

. Then, {γn

i , i = 1, 2, . . .} is a family of i.i.d. random variables with

distribution exp(2n2).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 32 / 82

slide-33
SLIDE 33

Definition of X(n)

X (n)

 

i

  • j=0

γn

j

  = W  

i

  • j=0

σn

j

  , i = 1, 2, . . .

with lineal interpolation.

t1

n

t2

n

t3

n

B

T

X

n

g 1

n

s 1

n

B X ( )

n g 1

n

B( )

s 1

n

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 33 / 82

slide-34
SLIDE 34

Definition of X(n)

τ n

i = i-th slope change.

The increments τ n

i − τ n i−1, i = 1, 2, . . . , with τ n 0 = 0, are independent

with distribution exp(n2).

t1

n

t2

n

t3

n

B

T

X

n

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 34 / 82

slide-35
SLIDE 35

Approximation of Bm

t1

n

t2

n

t3

n

B

T

X

n

Theorem (Griego, Heath and Ruiz-Moncayo (1971))

Let {W (t), t ≥ 0} be a given Brownian motion on (Ω, F, P). Then, lim

n→∞ max 0≤t≤1 |X (n)(t) − W (t)| = 0,

a.s.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 35 / 82

slide-36
SLIDE 36

Approximation of Bm

t1

n

t2

n

t3

n

B

T

X

n

Theorem (Gorostiza y Griego (1980))

For any q > 0, we have P

  • max

0≤t≤1 |X (n)(t) − W (t)| > αn− 1

2(log n) 5 2

  • = o(n−q),

as n → ∞, where α > 0.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 36 / 82

slide-37
SLIDE 37

Contents

1

Some Approximations of FBM

2

Transport Processes

3

Approximation of FBM by Means of Transport Processes

4

Approximatios of Fractional Stochastic Differential Equations

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 37 / 82

slide-38
SLIDE 38

Mandelbrot-van Ness representation

BH

t = CH −∞[(t − s)H−1/2 − (−s)H−1/2]dW (s)

+

t

0 (t − s)H−1/2dW (s)

  • ,

where CH = (2H sin πHΓ(2H))1/2/Γ(H + 1/2) and W = (W (t))t∈R is a Brownian motion.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 38 / 82

slide-39
SLIDE 39

Mandelbrot-van Ness representation

BH

t = CH −∞[(t − s)H−1/2 − (−s)H−1/2]dW (s)

+

t

0 (t − s)H−1/2dW (s)

  • ,

For a < 0, BH

t

= CH

t

0 gt(s)dW (s) + a ft(s)dW (s) +

a

−∞ ft(s)dW (s)

  • =

CH

t

0 gt(s)dW (s) +

  • a

0ft(s)dW (s) + ft(a)W (a)

1 a

∂sft

1

v

1

v 2W

1

v

  • dv
  • .

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 39 / 82

slide-40
SLIDE 40

Mandelbrot-van Ness representation

For a < 0, BH

t

= CH

t

0 gt(s)dW (s) + a ft(s)dW (s) +

a

−∞ ft(s)dW (s)

  • =

CH

t

0 gt(s)dW (s) +

  • a

0ft(s)dW (s) + ft(a)W (a)

1 a

∂sft

1

v

1

v 2W

1

v

  • dv
  • .

Here, ft(s) = (t − s)H−1/2 − (−s)H−1/2, s < 0 ≤ t ≤ T, and gt(s) = (t − s)H−1/2, 0 < s < t ≤ T.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 40 / 82

slide-41
SLIDE 41

Transport processes

For a < 0, we introduce the following :

1

(W1(s))0≤s≤T, the restriction of W on [0, T].

2

(W2(s))a≤s≤0, the restriction of W on [a, 0].

3

W3(s) =

  

sW ( 1

s )

si s ∈

  • 1

a, 0

  • ,

si s = 0.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 41 / 82

slide-42
SLIDE 42

Transport processes

For a < 0, we introduce the following :

1

(W1(s))0≤s≤T, the restriction of W on [0, T].

2

(W2(s))a≤s≤0, the restriction of W on [a, 0].

3

W3(s) =

  

sW ( 1

s )

si s ∈

  • 1

a, 0

  • ,

si s = 0. Then we can find (X (n)

1 (s))0≤s≤T,

(X (n)

2 (s))a≤s≤0

and (X (n)

3 (s)) 1

a ≤s≤0, Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 42 / 82

slide-43
SLIDE 43

Transport processes

For a < 0, we introduce the following :

1

(W1(s))0≤s≤T, the restriction of W on [0, T].

2

(W2(s))a≤s≤0, the restriction of W on [a, 0].

3

W3(s) =

  

sW ( 1

s )

si s ∈

  • 1

a, 0

  • ,

si s = 0. Then we can find (X (n)

1 (s))0≤s≤T,

(X (n)

2 (s))a≤s≤0

and (X (n)

3 (s)) 1

a ≤s≤0,

such that, for any q > 0, P

  • sup

bi≤t≤ci

|Wi(t) − X (n)

i

(t)| > C (i)n−1/2(log n)5/2

  • = o(n−q),

as n → ∞.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 43 / 82

slide-44
SLIDE 44

Approximation of FBM

Let εn = −n−β/|H−1/2|. For H > 1/2, define B(n)(t) = CH

t

0 (t − s)H−1/2dX (n) 1 (s) + a ft(s)dX (n) 2 (s)

+ft(a)X (n)

2 (a) +

1 a

s∧εn

1 a

∂sft

1

v

1

v 3dv

  • dX (n)

3 (s)

  • Jorge A. León (Cinvestav–IPN)

A strong uniform approximation Roscoff 2010 44 / 82

slide-45
SLIDE 45

Approximation of FBM

Let εn = −n−β/|H−1/2|. For H > 1/2, define B(n)(t) = CH

t

0 (t − s)H−1/2dX (n) 1 (s) + a ft(s)dX (n) 2 (s)

+ft(a)X (n)

2 (a) +

1 a

s∧εn

1 a

∂sft

1

v

1

v 3dv

  • dX (n)

3 (s)

  • and for H < 1/2, set

ˆ B(n)(t) = CH

(t+εn)∨0

gt(s)dX (n)

1 (s)

+

t

(t+εn)∨0(t − εn − s)H−1/2dX (n) 1 (s) +

εn

a

ft(s)dX (n)

2 (s)

+ft(a)X (n)

2 (a) +

1 a

s

1 a

∂sft

1

v

1

v 3dv

  • dX (n)

3 (s)

  • .

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 45 / 82

slide-46
SLIDE 46

Approximation of FBM

Let εn = −n−β/|H−1/2|. For H > 1/2, define B(n)(t) = CH

t

0 (t − s)H−1/2dX (n) 1 (s) + a ft(s)dX (n) 2 (s)

+ft(a)X (n)

2 (a) +

1 a

s∧εn

1 a

∂sft

1

v

1

v 3dv

  • dX (n)

3 (s)

  • Theorem

For any q > 0 and β such that 0 < H − 1

2 < β < 1 2, there exists

C > 0 such that P

  • sup

0≤t≤T

  • BH(t) − B(n)(t)
  • > Cn−(1/2−β)(log n)5/2
  • = o(n−q)

as n → ∞.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 46 / 82

slide-47
SLIDE 47

Approximation of FBM

For H < 1/2, set ˆ B(n)(t) = CH

(t+εn)∨0

gt(s)dX (n)

1 (s)

+

t

(t+εn)∨0(t − εn − s)H−1/2dX (n) 1 (s) +

εn

a

ft(s)dX (n)

2 (s)

+ft(a)X (n)

2 (a) +

1 a

s

1 a

∂sft

1

v

1

v 3dv

  • dX (n)

3 (s)

  • .

Theorem

For any q > 0 and β such that 0 < 1

2 − H < β < 1 2, there exists

ˆ C > 0 such that P

  • sup

0≤t≤T

  • BH(t) − ˆ

B(n)(t)

  • > ˆ

Cn−(1/2−β)(log n)5/2

  • = o(n−q).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 47 / 82

slide-48
SLIDE 48

Approximation of FBM

Lemma

Let H > 1/2. Then, for any q > 0, there exists C2 > 0 such that, for αn = n−(1/2−β)(log n)5/2, P

  • sup

0≤t≤T CH

  • t

0 (t − s)H−1/2dW1(s)

t

0 (t − s)H−1/2dX (n) 1 (s)

  • > C2

αn 5

  • = o(n−q)

as n → ∞.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 48 / 82

slide-49
SLIDE 49

Approximation of FBM

Lemma

Let H > 1/2. Then, for any q > 0, there exists C2 > 0 such that, for αn = n−(1/2−β)(log n)5/2, P

  • sup

0≤t≤T CH

  • t

0 (t − s)H−1/2dW1(s)

t

0 (t − s)H−1/2dX (n) 1 (s)

  • > C2

αn 5

  • = o(n−q)

as n → ∞. Proof : By the integration by parts formula,

t

0 (t − s)H−1/2dW1(s) = (H − 1/2)

t

0 (t − s)H−3/2W1(s)ds.

and

t

0 (t − s)H−1/2dX (n) 1 (s) = (H − 1/2)

t

0 (t − s)H−3/2X (n) 1 (s)ds.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 49 / 82

slide-50
SLIDE 50

Approximation of FBM

Lemma

Let H > 1/2. Then, for any q > 0, there exists C2 > 0 such that, for αn = n−(1/2−β)(log n)5/2, P

  • sup

0≤t≤T CH

  • t

0 (t − s)H−1/2dB1(s)

t

0 (t − s)H−1/2dX (n) 1 (s)

  • > C2

αn 5

  • = o(n−q)

as n → ∞. Proof : Then

  • t

0 (t − s)H−1/2dW1(s) −

t

0 (t − s)H−1/2dX (n) 1 (s)

  • ≤ sup

0≤s≤t

  • W1(s) − X (n)

1 (s)

  • tH−1/2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 50 / 82

slide-51
SLIDE 51

Bibliography

  • L. Gorostiza, Rate of convergence of uniform transport processe

to Brownian motion and apprications to stochastic integrals.

  • Stoch. 3, 1980.
  • R. Griego, D. Heath and A. Ruiz, Almost sure convergence of

uniform transport processes to Brownian motion. Annals of

  • Math. Stat. 42-3, 1129-1131, 1971.
  • T. Szabados, Strong approximation of fractional Brownian

motion by moving averages of simple random walks. Stoc. Proc.

  • Appl. 92, 31-60, 2001.
  • T. Sottinen, Fractional Brownian Motion, Random Walks and

Binary Market Models. Finance and stochastic. Springer-Verlag, 2001.

  • M. Taqqu, Weak convergence to fractional Brownian motion and

to the Rosenblatt process. Z. Wahrsch. and Verw. Gebiete 31, 287-302, 1975.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 51 / 82

slide-52
SLIDE 52

Contents

1

Some Approximations of FBM

2

Transport Processes

3

Approximation of FBM by Means of Transport Processes

4

Approximatios of Fractional Stochastic Differential Equations

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 52 / 82

slide-53
SLIDE 53

Equation

Our objective is to obtain an approximation with rate of convergence for solution of fractional stochastic differential equations of the type Xt = x0 +

t

0 σ(Xs) ◦ dBs +

t

0 b(Xs)ds,

t ∈ [0, T],

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 53 / 82

slide-54
SLIDE 54

Equation

Our objective is to obtain an approximation with rate of convergence for solution of fractional stochastic differential equations of the type Xt = x0 +

t

0 σ(Xs) ◦ dBs +

t

0 b(Xs)ds,

t ∈ [0, T], where B = (Bt)t∈[0,T] is fBm with Hurst parameter H ∈ ( 1

4, 1),

(H = 1/2), with σ ∈ C 2

b, b ∈ C 1 b and b is bounded.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 54 / 82

slide-55
SLIDE 55

Equation

Our objective is to obtain an approximation with rate of convergence for solution of fractional stochastic differential equations of the type Xt = x0 +

t

0 σ(Xs) ◦ dBs +

t

0 b(Xs)ds,

t ∈ [0, T], where B = (Bt)t∈[0,T] is fBm with Hurst parameter H ∈ ( 1

4, 1),

(H = 1/2), with σ ∈ C 2

b, b ∈ C 1 b and b is bounded.

The stochastic integral with respect to B is the forward integral for H > 1

2, and the Stratonovich integral for H < 1 2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 55 / 82

slide-56
SLIDE 56

Equation

Our objective is to obtain an approximation with rate of convergence for solution of fractional stochastic differential equations of the type Xt = x0 +

t

0 σ(Xs) ◦ dBs +

t

0 b(Xs)ds,

t ∈ [0, T], where B = (Bt)t∈[0,T] is fBm with Hurst parameter H ∈ ( 1

4, 1),

(H = 1/2), with σ ∈ C 2

b, b ∈ C 1 b and b is bounded.

By Alòs, León and Nualart, and Neuenkirch and Nourdin, this equation has an unique solution X with a Doss-Sussmann type representation Xt = h(Yt, Bt),

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 56 / 82

slide-57
SLIDE 57

Equation

Our objective is to obtain an approximation with rate of convergence for solution of fractional stochastic differential equations of the type Xt = x0 +

t

0 σ(Xs) ◦ dBs +

t

0 b(Xs)ds,

t ∈ [0, T], By Alòs, León and Nualart, and Neuenkirch and Nourdin, this equation has an unique solution X with a Doss-Sussmann type representation Xt = h(Y t, Bt), where ∂h ∂x2 (x1, x2) = σ(h(x1, x2)), h(x1, 0) = x1, x1, x2 ∈ R, and Y ′

t = exp

Bt

σ′(h(Yt, s))ds

  • b(h(Yt, Bt)),

Y0 = x0.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 57 / 82

slide-58
SLIDE 58

Equation

Xt = x0 +

t

0 σ(Xs) ◦ dBs +

t

0 b(Xs)ds,

t ∈ [0, T], By Alòs, León and Nualart, and Neuenkirch and Nourdin, this equation has an unique solution X Xt = h(Y t, Bt), where ∂h ∂x2 (x1, x2) = σ(h(x1, x2)), h(x1, 0) = x1, x1, x2 ∈ R, and Y ′

t

= exp

Bt

σ′(h(Yt, s))ds

  • b(h(Yt, Bt)),

=

∂h

∂x1 (Yt, Bt)

−1

b(h(Yt, Bt)), Y0 = x0.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 58 / 82

slide-59
SLIDE 59

Approximation scheme

h(x, y) = x +

y

0 σ(h(x, s))ds.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 59 / 82

slide-60
SLIDE 60

Approximation scheme

h(x, y) = x +

y

0 σ(h(x, s))ds.

For each n = 1, 2, · · · , we take −n = y n

−n2 < · · · < y n −1 < y n 0 = 0 < y n 1 < · · · < y n n2 = n,

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 60 / 82

slide-61
SLIDE 61

Approximation scheme

h(x, y) = x +

y

0 σ(h(x, s))ds.

For each n = 1, 2, · · · , we take −n = y n

−n2 < · · · < y n −1 < y n 0 = 0 < y n 1 < · · · < y n n2 = n,

where for rn = 1

n,

y n

i+1 = yi + rn = i + 1

n , y n

−(i+1) = y−i − rn = −i − 1

n .

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 61 / 82

slide-62
SLIDE 62

Approximation scheme

h(x, y) = x +

y

0 σ(h(x, s))ds.

For each n = 1, 2, · · · , we take −n = y n

−n2 < · · · < y n −1 < y n 0 = 0 < y n 1 < · · · < y n n2 = n,

where for rn = 1

n,

y n

i+1 = yi + rn = i + 1

n , y n

−(i+1) = y−i − rn = −i − 1

n . We define functions hn : R2 → R by hn(x, y) = 0 if (x, y) / ∈ [−n, n] × [−n, n], and for (x, y) ∈ [−n, n] × [−n, n] and k = 0, 1, · · · n2 − 1, as hn(x, y) = hn(x, y n

k ) + (y − y n k )σ(hn(x, y n k )),

y n

k ≤ y < y n k+1,

hn(x, y) = hn(x, y n

−k) − (y n −k − y)σ(hn(x, y n −k)), y n −(k+1) < y ≤ y n −k.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 62 / 82

slide-63
SLIDE 63

Approximation scheme

h(x, y) = x +

y

0 σ(h(x, s))ds.

y n

i+1 = yi + 1

n = i + 1 n , y n

−(i+1) = y−i − 1

n = −i − 1 n . We define functions hn : R2 → R by hn(x, y) = 0 if (x, y) / ∈ [−n, n] × [−n, n], and for (x, y) ∈ [−n, n] × [−n, n] and k = 0, 1, · · · n2 − 1, as hn(x, y) = hn(x, y n

k ) + (y − y n k )σ(hn(x, y n k )),

y n

k ≤ y < y n k+1,

hn(x, y) = hn(x, y n

−k) − (y n −k − y)σ(hn(x, y n −k)), y n −(k+1) < y ≤ y n −k,

with hn(x, y n

k+1) = hn(x, y n k ) + rnσ(hn(x, y n k )),

hn(x, y n

−(k+1)) = hn(x, y n −k) − rnσ(hn(x, y n −k)),

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 63 / 82

slide-64
SLIDE 64

Approximation of FBM

Let εn = −n−β/|H−1/2|. For H > 1/2, define B(n)(t) = CH

t

0 (t − s)H−1/2dX (n) 1 (s) + a ft(s)dX (n) 2 (s)

+ft(a)X (n)

2 (a) +

1 a

s∧εn

1 a

∂sft

1

v

1

v 3dv

  • dX (n)

3 (s)

  • and for H < 1/2, set

ˆ B(n)(t) = CH

(t+εn)∨0

gt(s)dX (n)

1 (s)

+

t

(t+εn)∨0(t − εn − s)H−1/2dX (n) 1 (s) +

εn

a

ft(s)dX (n)

2 (s)

+ft(a)X (n)

2 (a) +

1 a

s

1 a

∂sft

1

v

1

v 3dv

  • dX (n)

3 (s)

  • .

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 64 / 82

slide-65
SLIDE 65

Notation

Bn =

  

B(n) if H > 1

2,

ˆ B(n) if H < 1

2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 65 / 82

slide-66
SLIDE 66

Notation

Bn =

  

B(n) if H > 1

2,

ˆ B(n) if H < 1

2.

We have that Yt = x0 +

t ∂h

∂x1 (Ys, Bs)

−1

b(h(Ys, Bs))ds. For each n = 1, 2, · · · , we define the process Y n as the solution of Y n

t = x0 +

t ∂h

∂x1 (Y n

s , Bn s )

−1

b(h(Y n

s , Bn s ))ds.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 66 / 82

slide-67
SLIDE 67

Notation

Bn =

  

B(n) if H > 1

2,

ˆ B(n) if H < 1

2.

For each n = 1, 2, · · · , we define the process Y n as the solution of Y n

t = x0 +

t ∂h

∂x1 (Y n

s , Bn s )

−1

b(h(Y n

s , Bn s ))ds.

That is, (Y n

t )′ = f (Y n t , Bn t )

Y n

t0 = x0,

t0 = 0, where f (x, y) = exp

y

0 σ′(h(x, u)du)

  • b(h(x, y)).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 67 / 82

slide-68
SLIDE 68

Notation

Bn =

  

B(n) if H > 1

2,

ˆ B(n) if H < 1

2.

For each n = 1, 2, · · · , we define the process Y n as the solution of (Y n

t )′ = f (Y n t , Bn t )

Y n

t0 = x0,

t0 = 0, where f (x, y) = exp

y

0 σ′(h(x, u)du)

  • b(h(x, y)).

For each n = 1, 2, · · · , we define f n(x, y) = exp

y

0 σ′(hn(x, u)du)

  • b(hn(x, y)),

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 68 / 82

slide-69
SLIDE 69

Euler scheme

For each n = 1, 2, · · · , we define the process Y n as the solution of (Y n

t )′ = f (Y n t , Bn t )

Y n

t0 = x0,

t0 = 0, where f (x, y) = exp

y

0 σ′(h(x, u)du)

  • b(h(x, y)).

For each n = 1, 2, · · · , we define f n(x, y) = exp

y

0 σ′(hn(x, u)du)

  • b(hn(x, y)),

The Euler scheme ( ˆ Y n,m) for the above differential equation is defined as follows, for each m = 1, 2, · · · , the partition 0 = t0 < · · · < tn = T of [0, T] with ti+1 = ti + rm, and rm = T

m :

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 69 / 82

slide-70
SLIDE 70

Euler scheme

            

ˆ Y n,m = x0, ˆ Y n,m

tk+1 = ˆ

Y n,m

tk

+ rmf n( ˆ Y n,m

tk

, Bn

tk),

k = 0, · · · , (m − 1), ˆ Y n,m

t

= ˆ Y n,m

tk

+ (t − tk)f n( ˆ Y n,m

tk

, Bn

tk)

= ˆ Y n,m

tk

+

t

tk f n( ˆ

Y n,m

tk

, Bn

tk)ds,

if tk ≤ t < tk+1.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 70 / 82

slide-71
SLIDE 71

Euler scheme

            

ˆ Y n,m = x0, ˆ Y n,m

tk+1 = ˆ

Y n,m

tk

+ rmf n( ˆ Y n,m

tk

, Bn

tk),

k = 0, · · · , (m − 1), ˆ Y n,m

t

= ˆ Y n,m

tk

+ (t − tk)f n( ˆ Y n,m

tk

, Bn

tk)

= ˆ Y n,m

tk

+

t

tk f n( ˆ

Y n,m

tk

, Bn

tk)ds,

if tk ≤ t < tk+1. Xt = x0 +

t

0 σ(Xs)dBs +

t

0 b(Xs)ds,

t ∈ [0, T], Xt = h(Yt, Bt),

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 71 / 82

slide-72
SLIDE 72

Euler scheme

            

ˆ Y n,m = x0, ˆ Y n,m

tk+1 = ˆ

Y n,m

tk

+ rmf n( ˆ Y n,m

tk

, Bn

tk),

k = 0, · · · , (m − 1), ˆ Y n,m

t

= ˆ Y n,m

tk

+ (t − tk)f n( ˆ Y n,m

tk

, Bn

tk)

= ˆ Y n,m

tk

+

t

tk f n( ˆ

Y n,m

tk

, Bn

tk)ds,

if tk ≤ t < tk+1. Xt = x0 +

t

0 σ(Xs)dBs +

t

0 b(Xs)ds,

t ∈ [0, T], Xt = h(Yt, Bt). Here, we define the approximation of X as X n

t := hn( ˆ

Y n,n2

t

, Bn

t ).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 72 / 82

slide-73
SLIDE 73

Euler scheme

Theorem

For any β such that |H − 1/2| < β < 1/2, P

  • lim sup

n→∞

  • sup

t∈[0,T]

|Xt − X n

t | > αn

  • = 0,

where αn = n−(1/2−β)(log n)5/2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 73 / 82

slide-74
SLIDE 74

Proof : Approximation of h

For fixed n, we work in the square [−n, n] × [−n, n]. Let l = n + m for some m > 0, and consider the finer partition of [−n, n] given by −n = y l

−nl < · · · < y l 0 = 0 < · · · < y l nl = n, with rl = 1 l .

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 74 / 82

slide-75
SLIDE 75

Proof : Approximation of h

For fixed n, we work in the square [−n, n] × [−n, n]. Let l = n + m for some m > 0, and consider the finer partition of [−n, n] given by −n = y l

−nl < · · · < y l 0 = 0 < · · · < y l nl = n, with rl = 1 l .

Lemma

For all (x, y) ∈ [−n, n] × [−n, n] and l > n,

  • h(x, y) − hl(x, y)
  • ≤ ¯

M2n l exp ( ¯ Mn).

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 75 / 82

slide-76
SLIDE 76

Proof : Approximation of Y

We have that Yt = x0 +

t ∂h

∂x1 (Ys, Bs)

−1

b(h(Ys, Bs))ds. For each n = 1, 2, · · · , we define the process Y n as the solution of Y n

t = x0 +

t ∂h

∂x1 (Y n

s , Bn s )

−1

b(h(Y n

s , Bn s ))ds.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 76 / 82

slide-77
SLIDE 77

Proof : Approximation of Y

We have that Yt = x0 +

t ∂h

∂x1 (Ys, Bs)

−1

b(h(Ys, Bs))ds. For each n = 1, 2, · · · , we define the process Y n as the solution of Y n

t = x0 +

t ∂h

∂x1 (Y n

s , Bn s )

−1

b(h(Y n

s , Bn s ))ds.

Proposition

We have P

  • lim sup

n→∞ {Y − Y n∞ > αn}

  • = 0,

where αn = n−(1/2−β)(log n)5/2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 77 / 82

slide-78
SLIDE 78

Proof : Approximation of Y n

Proposition

Let Y n and ˆ Y n,m be as above. Then P

  • lim sup

n→∞

  • Y n − ˆ

Y n,n2∞ > αn

  • = 0

where αn = n−(1/2−β)(log n)5/2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 78 / 82

slide-79
SLIDE 79

Proof : Approximation of Y

We have that Yt = x0 +

t ∂h

∂x1 (Ys, Bs)

−1

b(h(Ys, Bs))ds. For each n = 1, 2, · · · , we define the process Y n as the solution of Y n

t = x0 +

t ∂h

∂x1 (Y n

s , Bn s )

−1

b(h(Y n

s , Bn s ))ds.

Proposition

We have P

  • lim sup

n→∞ {Y − Y n∞ > αn}

  • = 0,

where αn = n−(1/2−β)(log n)5/2.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 79 / 82

slide-80
SLIDE 80

Proof : Approximation of Y

Proposition

We have P

  • lim sup

n→∞ {Y − Y n∞ > αn}

  • = 0,

where αn = n−(1/2−β)(log n)5/2. Proof. |Yt − Y n

t | =

  • t

∂h

∂x1 (Ys, Bs)

−1

b(h(Ys, Bs))ds −

t ∂h

∂x1 (Y n

s , Bn s )

−1

b(h(Y n

s , Bn s ))ds

t

0 I1(s)ds +

t

0 I2(s)ds,

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 80 / 82

slide-81
SLIDE 81

Proof : Approximation of Y

Proof. |Yt − Y n

t | =

  • t

∂h

∂x1 (Ys, Bs)

−1

b(h(Ys, Bs))ds −

t ∂h

∂x1 (Y n

s , Bn s )

−1

b(h(Y n

s , Bn s ))ds

t

0 I1(s)ds +

t

0 I2(s)ds,

where I1(s) =

  • ∂h

∂x1 (Ys, Bs)

−1

∂h

∂x1 (Y n

s , Bn s )

−1

  • |b(h(Y n

s , Bn s ))| ,

and I2(s) =

  • ∂h

∂x1 (Ys, Bs)

−1

  • |b(h(Ys, Bs)) − b(h(Y n

s , Bn s ))| .

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 81 / 82

slide-82
SLIDE 82

Proof : Approximation of Y

Proof. |Yt − Y n

t | =

  • t

∂h

∂x1 (Ys, Bs)

−1

b(h(Ys, Bs))ds −

t ∂h

∂x1 (Y n

s , Bn s )

−1

b(h(Y n

s , Bn s ))ds

t

0 I1(s)ds +

t

0 I2(s)ds,

where

t

0 I2(s)ds

t

0 exp(M B∞)[M exp(M B∞)|Ys − Y n s | + M|Bs − Bn s |]ds.

Jorge A. León (Cinvestav–IPN) A strong uniform approximation Roscoff 2010 82 / 82