This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Math136/Stat219 Fall 2008 Sample Final Examination Write your name and sign the Honor code in the blue books provided. You have 3 hours to solve all questions, each worth points as marked (maximum of 100). Complete reasoning is required for full credit. You may cite lecture notes and homework sets, as needed, stating precisely the result you use, why and how it applies. Important note: If you wish to use a result that is contained in an Exercise in the course notes that was not assigned for homework or proved in lecture, you must prove the result yourself (i.e. you cannot just site the Exercise number.) You may consult the following materials while taking the exam: 1. Stat219/Math136 Lecture notes, Fall 2008 version (the required text) 2. Kevin Rosss Lecture slides posted in Coursework 3. Homework problems and solutions posted in Coursework 4. Your own graded homework papers 5. Your own notes taken during lecture Use of any other material is prohibited and constitutes a violation of the Honor Code. This includes, but is not limited to: other texts (including optional and recommended texts), photocopying of texts or notes, materials from previous sections of Stat219/Math136, the internet, programming formulas or other results in a calculator or computer, consultation with anyone during the exam (except for the Instructors or Teaching Assistants). 1. (5x5) Consider a simple, symmetric random walk. That is, let 1 , 2 ,... be a sequence of independent random variables with P ( k = 1) = P ( k = 1) = 1 / 2 for all k . Let S = 0 and S n = n k =1 k for n = 1 , 2 ,... . Let F n = ( 1 ,..., n ). For fixed positive integers a and b let = min { n 0 : S n / ( a,b ) } . You may assume that < a.s. a) Show that is an {F n }stopping time. 1 ANS: { = n } = { S 1 ( a,b ) ,...,S n 1 ( a,b ) ,S n / ( a,b ) } F n since F n = ( S 1 ,...,S n ) (because S n is defined through an invertible transformation of 1 ,..., n ; see Corollary 1.2.17). This is enough to show that is a discrete time {F n }stopping time. b) Show that { S 2 n n } is an {F n }martingale. ANS: Clearly, {F n } is a filtration to which { S 2 n n } is adapted. Checking integrability, since k { 1 , 1 } , we have  S n  n and so IE  S 2 n n  n 2 + n < for any fixed n . Finally using the independence and distributions of n : IE [ S 2 n +1 ( n + 1) F n ] = IE [( S n + n +1 ) 2 F n ] ( n + 1) = S 2 n + IE ( 2 n +1 ) 2 S n IE ( n +1 ) ( n + 1) = S 2 n + 1 + 0 ( n + 1) = S 2 n n c) Show that E ( N ) = E ( S 2 N ) for any fixed positive integer N ....
View Full
Document
 Fall '08
 2

Click to edit the document details