Assignments - MG, BM, SBM, Sto. Calculus, SDE
Assignments - MG, BM, SBM, Sto. Calculus, SDE
7 Problems
(i) E (N+|F), s, t 2 0;
So 0. Sn =
1et
Le
lar ( ) = o 2<
Iif**** In, n 2
RVs with EY, 0 1, Y; being i.i.d.
Show that Xn := S
00. =
fltration no(A1,.,Xn).
Hint. Use the result of (i) and the fact that F,
(ii) C Fn (why does the last
relation hold?).
T. Denote by {N}i2o a Poisson process with rate A >0. Show that aill three
processes i) N-At; (i) ( - M) - t ; (ii) exp{uN - t(e" - 1)} (u is a
fxed real number) are MGs w.r.t. the filtration Fn = o(Ns, s < t).
S. Let So = 0, Sn = Yi t + Yn, n 2 1, Y; being ii.d. RVs with P (Y1 =
1) = 1 -P (Yi = -1) = 1/2. Denote by T:= min{n 20: Sn = a or Sn= 6}
the first time the RW S,, hits one of the (integer) barTiers a < 0 < b. Use
Theorem 11.2, without verifying its conditions in detail, to:
i) compute ET.
and the MG
Hints. (i) Use the martingale Xn := Sn. (ii) Use the result of (i)
from Problem 6.
each play (in which you
.Suppose you are game" betting $1 at
playing a "fair
fortune after
independently of the past). Then {Xn : your
win/lose w.p.,
MG
F F1,F2,.. .j.
w.r.t. its "history"
=
{JFo,
nplaysn>0 is an
stake can be a n arbitrary
each play n =1,2,..., your
NOW suppose that, for have to decide how much
to stake before that play,
boUnded amount Yn, but you Mathematically, this
1 (inclusive).
basing on the history up to play n -
and {Ynfn>1 is a
predictable
Const < 0 ,
|Ynl Cn =
n= 1,2,...; Zo =0.
Zn = Y(X -X*-1),
k=l show that Xt > E(YIF)
One can
martingale.
1S NOT the as
is referred to a s a Lévy
same
IG Speaking, o
(generally
:=o(U. >Ft) MG for s o m e Y.
Sas t 0 , where F MG is the Lévy
In fact, any
uniformly integrable problem using a different approach
n0t'). (gambler's ruin)
17N nat we already solved that
e case in (3.44))
in Example 3.21 (see the second
is called the martingale transforn!8 of
The process {.\,,}no X by Y
MG w.r.t. F.
Show that {Z»}n>o is an
(i)
The betting strategy
ot donbling when losing is called" called "nmartingale", Yom
(i)
begin with a
unit stake, win cach play w.p. (regardless of the results
and double your stake for the next
next nlas of
all the previous plays), when play
After each win. you reset the stake size to one. your net Represent gain losing,
ing
2when using this strategy as a martingale transform: specifv tho.
eSSes
and {»
(ii) Under the assumptions of part (i), assume that you stop at tho t:
the first win. Find the distribution and expectation of the ST T and v .
time
the statenment of Theorem 11.2 holds for the process {Z,} and ST T. verify if
(iv) Compute the expectation E(Z; T > n) and hence verify if the gen
eneral
condition (11.11) sutficient for (11.9) is satisfied in this case.
11.2 he
MG from part (i) to find the ana 11.2
and the MG distribution of RV the ST, and then 'Theore
{Z, = Sn -
n(p -
q)} to E
12. Show that the set compute T.
dense in [0,1 with {U1, U2,...}, where U; are i.i.d. U(0, 1)-RVs, is every where
probability 1.
Hnt. You may wish
to use the
13. Find the Glivenko-Cantelli theorem (2.8/).
14. Find the
distribution of X :=
2W, - Wig, 0< ti < ta.
distribution of X:= Wo +
15. Derive the W2- W3 + 2W4.
BM's FDD
and the
observation thatdensity f ri,... ,#n) see (11.22)) using (2.33)
n) (see
(Wt,
transformation of the vector Wt,.. ,W,) is the result
o simple) line
linear
result of simple a
(W Wta, Wt wiu
- with
analogues of stochastic
mathematical theory play
an im
of finance
in
integrals ana
P
discrete time.
independent mDonents, so that the latter vector's
density is just the product
idepenuies of the increments W- Wi-,
of the da
k =
1,2,... , n.
the transformation of the standard normal vector ZE R" into the
1
Note
No
vector of
the values of the standard BM from the simulation algorithm on
ritten
in the matrix form as (W..., W,) = ZA, A E R"xn
be writ
320 c a n
Specify the matrix A. How will the above matrix representation change if
were to directly simulate the vector (Xt1,...,Xt,), where {X} is the
you
arithmetic BM (11.16)?
to compute
ability space,
with a BM
=
Jo E Sg, ds, t e [0,T].
that E I(f)L{9)
23. Let g be a non-random
finction on [0,7| satisfying ad
fdt . Use Itós
formula to show that the following process is an MG
Y expg,dW,-9 d s , 0
te 0,T].
dS =
0.2S,dt +StdW, t20, 5
(this is special case of the so-called Black-Scholes framnework
a
in Chapter 13).
to be discised
Xo =
0.2.
27. The "stochastic volatility" Heston model
{Ve}r20 follows the SDE assumes that the "variance procesS
dV =
(1 V)dt
-