QUESTIONS AND SOLUTIONS

Similar documents
Problem Sheet 1. You may assume that both F and F are σ-fields. (a) Show that F F is not a σ-field. (b) Let X : Ω R be defined by 1 if n = 1

Lecture 5. 1 Chung-Fuchs Theorem. Tel Aviv University Spring 2011

Markov processes Course note 2. Martingale problems, recurrence properties of discrete time chains.

P (A G) dp G P (A G)

UNIVERSITY OF BRISTOL. Mock exam paper for examination for the Degrees of B.Sc. and M.Sci. (Level 3)

Constructing Approximations to Functions

Midterm 1. Every element of the set of functions is continuous

Stochastic Processes

STOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER. Department of Mathematics. University of Wisconsin.

Lecture 2. We now introduce some fundamental tools in martingale theory, which are useful in controlling the fluctuation of martingales.

A PROBABILISTIC MODEL FOR CASH FLOW

Preliminary Exam: Probability 9:00am 2:00pm, Friday, January 6, 2012

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

Notes 15 : UI Martingales

Spring 2012 Math 541B Exam 1

Lecture 12. F o s, (1.1) F t := s>t

Information Theory and Statistics Lecture 3: Stationary ergodic processes

1 Implicit Differentiation

1 Sequences of events and their limits

Fundamental Inequalities, Convergence and the Optional Stopping Theorem for Continuous-Time Martingales

Math 6810 (Probability) Fall Lecture notes

Read carefully the instructions on the answer book and make sure that the particulars required are entered on each answer book.

Mathematical Institute, University of Utrecht. The problem of estimating the mean of an observed Gaussian innite-dimensional vector

Computer Intensive Methods in Mathematical Statistics

7 Convergence in R d and in Metric Spaces

Doléans measures. Appendix C. C.1 Introduction

The symmetry in the martingale inequality

Monte Carlo Methods for Stochastic Programming

Probability A exam solutions

Stat-491-Fall2014-Assignment-III

Random G -Expectations

Exercise Exercise Homework #6 Solutions Thursday 6 April 2006

1. Aufgabenblatt zur Vorlesung Probability Theory

Solutions Final Exam May. 14, 2014

1 Ordinary points and singular points

Exercises: sheet 1. k=1 Y k is called compound Poisson process (X t := 0 if N t = 0).

Solution: (Course X071570: Stochastic Processes)

Lecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.

1 Continuous-time chains, finite state space

Economics 241B Review of Limit Theorems for Sequences of Random Variables

Manipulating Radicals

Lecture 2: Convergence of Random Variables

the time it takes until a radioactive substance undergoes a decay

Math 240 (Driver) Qual Exam (9/12/2017)

ADVANCED PROBABILITY: SOLUTIONS TO SHEET 1

2. Variance and Covariance: We will now derive some classic properties of variance and covariance. Assume real-valued random variables X and Y.

On some Metatheorems about FOL

Be sure this exam has 9 pages including the cover. The University of British Columbia

Random Process Lecture 1. Fundamentals of Probability

Homework 1 Solutions ECEn 670, Fall 2013

Lecture 13 and 14: Bayesian estimation theory

1. Let X and Y be independent exponential random variables with rate α. Find the densities of the random variables X 3, X Y, min(x, Y 3 )

Economics 472. Lecture 10. where we will refer to y t as a m-vector of endogenous variables, x t as a q-vector of exogenous variables,

Test Code: STA/STB (Short Answer Type) 2013 Junior Research Fellowship for Research Course in Statistics

Exercises: sheet 1. k=1 Y k is called compound Poisson process (X t := 0 if N t = 0).

Math 180B Homework 4 Solutions

Introduction to Real Analysis

1. Continuous Functions between Euclidean spaces

Lecture 11. Probability Theory: an Overveiw

Some Function Problems SOLUTIONS Isabel Vogt Last Edited: May 24, 2013

Notes by Zvi Rosen. Thanks to Alyssa Palfreyman for supplements.

IMC 2015, Blagoevgrad, Bulgaria

Math 273 (51) - Final

Plan Martingales cont d. 0. Questions for Exam 2. More Examples 3. Overview of Results. Reading: study Next Time: first exam

An Attempt To Understand Tilling Approach In proving The Littlewood Conjecture

FINAL PROJECT TOPICS MATH 399, SPRING αx 0 x < α(1 x)

CHAPTER 1. Martingales

Probability Theory. Richard F. Bass

MATH 829: Introduction to Data Mining and Analysis Consistency of Linear Regression

Lecture Notes 3 Convergence (Chapter 5)

Markov Chains CK eqns Classes Hitting times Rec./trans. Strong Markov Stat. distr. Reversibility * Markov Chains

Non-arbitrage condition and thin random times

Probability and Measure

MATH 1372, SECTION 33, MIDTERM 3 REVIEW ANSWERS

The Inclusion Exclusion Principle and Its More General Version

Exercises Measure Theoretic Probability

Two hours UNIVERSITY OF MANCHESTER. 21 January

Stochastic integration. P.J.C. Spreij

Modern Discrete Probability Branching processes

Pseudo-stopping times and the hypothesis (H)

Lecture 19 L 2 -Stochastic integration

The main purpose of this chapter is to prove the rst and second fundamental theorem of asset pricing in a so called nite market model.

Lecture 2: Review of Prerequisites. Table of contents

PROBABILITY VITTORIA SILVESTRI

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

Math 104 Section 2 Midterm 2 November 1, 2013

IEOR 6711: Stochastic Models I Fall 2013, Professor Whitt Lecture Notes, Thursday, September 5 Modes of Convergence

MATH 6605: SUMMARY LECTURE NOTES

Quiz 1 Date: Monday, October 17, 2016

REPORTRAPPORT. Centrum voor Wiskunde en Informatica. Asymptotics of zeros of incomplete gamma functions. N.M. Temme

Solutions: Problem Set 4 Math 201B, Winter 2007

Strongly Bounded Turing Reducibilities and Computably Enumerable Sets. 4. Strongly Bounded T- Reducibilities

Probability reminders

Math 164-1: Optimization Instructor: Alpár R. Mészáros

Lecture 3 - Tuesday July 5th

Exercise Sketch these lines and find their intersection.

Machine Learning: Homework 5

Probability Theory II. Spring 2016 Peter Orbanz

Admin and Lecture 1: Recap of Measure Theory

Transcription:

UNIVERSITY OF BRISTOL Examination for the Degrees of B.Sci., M.Sci. and M.Res. (Level 3 and Level M Martingale Theory with Applications MATH 36204 and M6204 (Paper Code MATH-36204 and MATH-M6204 January 2016 (Duration of examination: 1 hour and 30 minutes QUESTIONS AND SOLUTIONS This paper contains two questions ALL questions should be attempted. On this examination, the marking scheme is indicative and is intended only as a guide to the relative weighting of the questions. Calculators are not permitted in this examination. Do not turn over until instructed. Page 1 of 7

Cont... Martingales-16 Question 1 1a (10 marks Let (Ω, F, P be a probability space and A k, k = 1, 2,..., a countable (innite collection of measurable events. Prove the following two statements. (i. (5 marks If for all n N, A n A n+1 then P ( n N A n = lim n P (A n. (ii. (5 marks If for all n N, A n+1 A n then P ( n N A n = lim n P (A n. (i. Let B 1 := A 1 and B n+1 := A n+1 \ A n, n 1. Then B n F and if k l then B k B l =. Further on Hence A n = n B k, A n = ( ( P A n = P B k = B k. P (B k, ( n lim P (A n = lim P B k = lim n n and the right hand sides of the two equations are equal. n n P (B k, (ii. Use De Morgan's identity ( A n = and noting that A c n A c n+1 apply the result from (i.: ( ( ( ( c P A n = P = 1 P A c n A c n c A c n = lim n (1 P (Ac n = lim n P (A n. = 1 lim n P (Ac n Page 2 of 7

1b (40 marks At time n = 0, an urn contains 1 blue ball and 1 red ball. At each time n = 1, 2, 3,..., a ball is chosen at random from the urn and returned to the urn, together with a new ball of the same colour. Just after time n, there are n + 2 balls in the urn, of which B n are blue and R n are red. Let M n := B n B n + R n = be the proportion of blue balls in the urn just after time n. B n n + 2 (i. (8 marks Show that (relative to a natural ltration that you should specify M n, n = 0, 1, 2,... is a martingale. (ii. (12 marks Show that P (B n = k = 1/(n + 1 for 1 k n + 1. (Hint: Write down the probability of choosing k blue and n k red balls in whatever xed order. (iii. (8 marks Does M := lim M n exist? If it does, what is its distribution? (Hint: What is the limit of the distribution of M n (identied in the previous point as n? (iv. (12 marks Let T be the number of balls( drawn until the rst blue ball is chosen. Use the optional stopping theorem to show that E 1 T +2 = 1/4. You need to justify your usage of the optional stopping theorem rigorously. (i. The process B k, k = 0, 1, 2,... is a time inhomogeneous Markov chain on the state space Z +, with the following conditional expectations: for any f : Z + R, E ( f(b n+1 Bk, k = 0, 1,..., n = f(b n n B n + 1 n + 2 The natural ltration of the problem is F n := σ (B k, k = 0, 1,..., n, n 0. Next we check that M n dened in the question is indeed a martingale. + f(b n + 1 B n + 1 n + 2. M n := Bn+1 n+2 is expressed in terms of B n so it is obviously F n -measurable. M n 1, so it is obviously integrable. We check the martingale property using the formula for conditional expectations shown above. E ( M n+1 B n + 1 Fn = n + 3 n B n + 1 + B n + 2 n + 2 n + 3 Bn + 1 n + 2 = by elementary computations = B n + 1 n + 2 = M n. Page 3 of 7

(ii. By combinatorial enumeration one can easily see that the probability of choosing k blue and n k red balls in the rst n drawings in any xed particular order, is k!(n k! (n + 1!. Adding up all possible (distinct! orders of the k blue and n k red balls within the rst n drawings, we multiply the previous number by ( n n! = k k!(n k! and get the result B n UNI({0, 1,..., n}.. (iii. Since M n is uniformly bounded martingale the Martingale Convergence Theorem applies: M n M [0, 1] almost surely, as n. To obtain the distribution of M note that for any x [0, 1] ( P (M [0, x = P lim M n [0, x = lim P (M nx + 1 n [0, x = lim = x. n n n n + 1 Thus, M UNI[0, 1]. (iv. The Optional Stopping Theorem can be applied to the martingale M n, since M n is uniformly bounded, and The stopping time T is almost surely nite. Indeed: P (T = = lim P (T > n = lim P (B 1 n = 0 = lim n n n n + 1 = 0. So, we can apply the Optional Stopping Theorem to M n : ( 1 E = 1 T + 2 2 E (M T = 1 2 E (M 0 = 1 4. Continued... Page 4 of 7

Cont... Martingales-16 Question 2 2a (15 marks Let X and Y be independent random variables, both uniformly distributed on the interval [0, 1]. (That is, the random vector (X, Y is uniformly distributed on the square [0, 1] [0, 1]. Since X 0 almost surely, the random variable Z := Y/X is well dened. (i. (8 marks Since {Y = 0} = {Z = 0} almost surely, one may be tempted to think that P ( X < x Y = 0 = P ( X < x Z = 0. Compute and explain the result. (ii. (7 marks Compute P ( X < x Y = 0 := lim P ( X < x Y < ε, ε 0 P ( X < x Z = 0 := lim P ( X < x Z < ε, ε 0 P ( X < x σ(y (i. Fix ε (0, 1. Elementary computations yield and P ( X < x σ(z P ( X < x Y < ε = xε ε = x, P ( X < x Z < ε = x 2 ε 2 ε 2 = x 2. The two results are not the same. So we conclude that the formulations P ( X < x Y = 0, P ( X < x Z = 0 are vague and deceiving. The correct formulation is P ( X < x σ(y, P ( X < x σ(z and (ii. By straightforward elementary computations we obtain (for x 0: P ( X < x σ(y = min{x, 1}, P ( X < x σ(z = min{x 2, 1} 1 {Z 1} + min{x 2 Z 2, 1} 1 {Z 1}. Page 5 of 7

2b (15 marks Let (Ω, F, (F n n=0, P be a ltered probability space and X n, n 0, a sequence of absolutely integrable random variables adapted to the ltration (F n n=0. Assume that there exist real numbers a n, b n such that E ( X n+1 F n = an X n + b n. Find two real sequences A n and B n so that the sequence of random variables Z n := A n X n + B n, n > 1, be martingale w.r.t. the same ltration. Find a recursion for the coecients A n, B n, n 0. Hence the recursion equations The solution of these equations is E ( A n+1 X n+1 + B n+1 F n = An+1 E ( X n+1 F n + Bn+1 = A n+1 (a n X n + b n + B n+1! = A n X n + B n. A n+1 = a 1 n A n, B n+1 = B n A n+1 b n. A 0 = 1, A n = B 0 = 0, n 1 k=0 B n = a 1 k, n 1, n k 1 l=0 a 1 l b n 1, n 1. 2c (10 marks Let X 1, X 2, X 3,... be i.i.d. random variables with common distribution P (X i = +1 = p, P (X i = 1 = q := 1 p, and (F n n=0 their natural ltration. Denote S n := X 1 + + X n, n 1. For λ > 0 determine C = C(λ so that Z λ n := C n λ Sn be a martingale w.r.t. to the ltration (F n n=0. Page 6 of 7

For λ > 0, let m(λ := E ( λ X 1 = pλ + (1 pλ 1. Then C = C(λ = m(λ 1 will be the good choice. Indeed, E ( m(λ (n+1 λ S n+1 Fn = m(λ n λ Sn m(λ 1 E ( λ X n+1 Fn = m(λ n λ Sn m(λ 1 E ( λ X n+1 = m(λ n λ Sn. 2d (10 marks Let (Ω, F be a measurable space and (F n a ltration on it. Suppose S and T are stopping times with respect to the ltration (F n. Show that S T := min(s, T, S T := max(s, T, and S + T are also stopping times with respect to the same ltration. S T, S T, and S + T are classroom examples for "new stopping times form old ones". These examples were explicitly done in the class. See lecture notes. End of examination. Page 7 of 7