• Keine Ergebnisse gefunden

Exercises, 28th May

N/A
N/A
Protected

Academic year: 2021

Aktie "Exercises, 28th May"

Copied!
2
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Stochastic Processes II Summer term 2008 (Stochastische Analysis)

Prof. Dr. Uwe K¨ uchler Dr. Irina Penner

Exercises, 28th May

7.1 (4+3+1 points) For a standard Brownian motion (B

t

)

t≥0

and a ≥ 0 consider the first hitting time

T

a

:= inf

t ≥ 0

B

t

= a = inf

t ≥ 0

B

t

≥ a

and the first passage time

T

a+

:= inf

t ≥ 0

B

t

> a .

Show that:

a) The process T

a

(a ≥ 0) is a left-continuous increasing process, and the process T

a+

(a ≥ 0) is its right-continuous version, i.e.

T

a+

= lim

b↓a

T

b

and P [ T

a

= T

a+

] = 1 for all a ≥ 0.

b) For b > a is T

b

−T

a

independent of A

Ta

and has the same distribution as T

b−a

, i.e. it the process T

a

(a ≥ 0) has stationary independent increments.

c) T

a

and a

2

T

1

have the same distribution for all a ≥ 0.

7.2 (3+2 points) Let (A

t

)

t≥0

be a filtration satisfying usual conditions. An adapted cadlag process (X

t

)

t≥0

with X

0

= const is called a local mar- tingale, if there exists a ”localizing sequence” of stopping times (T

n

)

n∈N

, such that T

n

→ ∞ P -a.s., and the stopped process (X

t∧Tn

)

t≥0

is a mar- tingale with respect to (A

t

)

t≥0

for all n ∈ N . Let (X

t

)

t≥0

be a local martingale. Show that:

a) If (X

t

) is continuous, then the sequence of stopping times S

n

:= inf

t ≥ 0

|X

t

| > n (n ∈ N )

is a localizing sequence for (X

t

), and also any other sequence of

stopping times (R

n

)

n∈N

with R

n

≤ S

n

and R

n

→ ∞ P -a.s. Thus

we can assume without loss of generality that (X

t∧Tn

)

t≥0

is bounded

for all n ∈ N .

(2)

b) If X

t

≥ 0 for all t ≥ 0, then (X

t

)

t≥0

is a supermartingale.

7.3 (3+2 points)

a) Let (M

t

)

t≥0

be a continuous process such that both (M

t

, A

t

, t ≥ 0) and (M

t2

, A

t

, t ≥ 0) are local martingales. Prove that the process (M

t

) is P -a.s. constant.

b) Let (M

t

, A

t

, t ≥ 0) be a continuous local martingale with paths of finite variation. Prove that the process (M

t

) is P -a.s. constant.

The problems 7.1 -7.3 should be solved at home and delivered at Wednesday,

the 4th June, before the beginning of the tutorial.

Referenzen

ÄHNLICHE DOKUMENTE

should be solved at home and delivered at Wednesday, the 5th December, before the beginning of

should be solved at home and delivered at Wednesday, the 12th December, before the beginning of

To produce the integrated luminosity values used in ATLAS physics results, a single algorithm is chosen to provide the central value for a certain range of time, with the

In order to estimate the electron background, first a control sample is defined by requiring the same kinematic selection requirements as for the signal search sample, but requiring

Assume that each task generates a job as soon as the minimal interarrival time has elapsed, i.e. Show that there is a scheduling of the jobs for this interval that makes no job miss

a) Present a reachability/safety game whose winning condition encodes the following property:. A play is won by the universal player if it does not visit both x

Hint: To avoid the following construction becoming excessively large, restrict the domain to vectors of states that can actually occur.. b) Construct the parity word automaton

You have to ensure that you have copied the source code of your solved exercises to the server before the exercise class starts.. If necessary, ask your tutor how to copy files