We consider a sequence (X)-1 of i.i.d. random variables such that P(X₁ = 1) = P(X₁ = −1) = 1/2. Consider the filtration (F)1 given by = Fn(X1,..., Xn). For all n N, let Sn == Xbe the random walk. We have seen in class that the process (f(Sn)) is a martingale if and only if f satisfies D2f = 0, where n=0 D2f(x) = f(x + 1) − 2f(x) + f(x − 1). - (a) Use the result above to prove again that (en) No is not a martingale. n=0 (b) We consider a process (Y)-0 given by Y₁ = f(n, Sn). Show that (Yn) is a martin- gale provided that - f(n+1, x + 1) − 2f(n, x) + f(n + 1, x − 1) = 0, - for all n, x. (c) Let Y = pen with p = ete. Use (b) to prove that (Y) is a martingale. 2 (d) Since (Y) is a martingale, use the Martingale Representation Theorem guarantees that there exists a previsible process (Zn) such that Y₁ = In = (Z · S)n. Determine Zn and prove that it is previsible. 1
We consider a sequence (X)-1 of i.i.d. random variables such that P(X₁ = 1) = P(X₁ = −1) = 1/2. Consider the filtration (F)1 given by = Fn(X1,..., Xn). For all n N, let Sn == Xbe the random walk. We have seen in class that the process (f(Sn)) is a martingale if and only if f satisfies D2f = 0, where n=0 D2f(x) = f(x + 1) − 2f(x) + f(x − 1). - (a) Use the result above to prove again that (en) No is not a martingale. n=0 (b) We consider a process (Y)-0 given by Y₁ = f(n, Sn). Show that (Yn) is a martin- gale provided that - f(n+1, x + 1) − 2f(n, x) + f(n + 1, x − 1) = 0, - for all n, x. (c) Let Y = pen with p = ete. Use (b) to prove that (Y) is a martingale. 2 (d) Since (Y) is a martingale, use the Martingale Representation Theorem guarantees that there exists a previsible process (Zn) such that Y₁ = In = (Z · S)n. Determine Zn and prove that it is previsible. 1
Trigonometry (MindTap Course List)
10th Edition
ISBN:9781337278461
Author:Ron Larson
Publisher:Ron Larson
Chapter6: Topics In Analytic Geometry
Section6.4: Hyperbolas
Problem 5ECP: Repeat Example 5 when microphone A receives the sound 4 seconds before microphone B.
Related questions
Question
![We consider a sequence (X)-1 of i.i.d. random variables such that
P(X₁ = 1) = P(X₁ = −1) = 1/2.
Consider the filtration (F)1 given by
=
Fn(X1,..., Xn).
For all n N, let Sn ==
Xbe the random walk. We have seen in class that the
process (f(Sn)) is a martingale if and only if f satisfies D2f = 0, where
n=0
D2f(x) = f(x + 1) − 2f(x) + f(x − 1).
-
(a) Use the result above to prove again that (en) No is not a martingale.
n=0
(b) We consider a process (Y)-0 given by Y₁ = f(n, Sn). Show that (Yn) is a martin-
gale provided that
-
f(n+1, x + 1) − 2f(n, x) + f(n + 1, x − 1) = 0,
-
for all n, x.
(c) Let Y = pen with p = ete. Use (b) to prove that (Y) is a martingale.
2
(d) Since (Y) is a martingale, use the Martingale Representation Theorem guarantees
that there exists a previsible process (Zn) such that Y₁ = In = (Z · S)n. Determine
Zn and prove that it is previsible.
1](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F4a1c925e-790f-448e-9276-e5adcf0e8758%2F6050c4d1-5d91-487c-ac42-fdb4ac3d1691%2Fc8orcm_processed.png&w=3840&q=75)
Transcribed Image Text:We consider a sequence (X)-1 of i.i.d. random variables such that
P(X₁ = 1) = P(X₁ = −1) = 1/2.
Consider the filtration (F)1 given by
=
Fn(X1,..., Xn).
For all n N, let Sn ==
Xbe the random walk. We have seen in class that the
process (f(Sn)) is a martingale if and only if f satisfies D2f = 0, where
n=0
D2f(x) = f(x + 1) − 2f(x) + f(x − 1).
-
(a) Use the result above to prove again that (en) No is not a martingale.
n=0
(b) We consider a process (Y)-0 given by Y₁ = f(n, Sn). Show that (Yn) is a martin-
gale provided that
-
f(n+1, x + 1) − 2f(n, x) + f(n + 1, x − 1) = 0,
-
for all n, x.
(c) Let Y = pen with p = ete. Use (b) to prove that (Y) is a martingale.
2
(d) Since (Y) is a martingale, use the Martingale Representation Theorem guarantees
that there exists a previsible process (Zn) such that Y₁ = In = (Z · S)n. Determine
Zn and prove that it is previsible.
1
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Similar questions
Recommended textbooks for you
![Trigonometry (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337278461/9781337278461_smallCoverImage.gif)
Trigonometry (MindTap Course List)
Trigonometry
ISBN:
9781337278461
Author:
Ron Larson
Publisher:
Cengage Learning
![Trigonometry (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337278461/9781337278461_smallCoverImage.gif)
Trigonometry (MindTap Course List)
Trigonometry
ISBN:
9781337278461
Author:
Ron Larson
Publisher:
Cengage Learning