Show thatnbspxnnbspand ijgennbsparenbspstatistically


This is a very simple exercise designed to clarify confusion about the roles of past, present, and future in stopping rules. Let {Xn≥ 1} be a sequence of IID binary rv s, each with the PMF p(1) = 1/2, p(0) = 1/2. Let be a positive integer- valued rv that takes on the sample value of the first trial for which X= 1. That is, for each ≥ 1,

{n}= {X1=0,  X2=0, ... Xn-1=0, Xn=1}.

(a) Use the definition of stopping trial, Definition 5.5.1 in the text, to show that is a stopping trial for {Xn≥ 1}.

(b) Show that for any given n, the rv s Xand IJ=are statistically dependent.

(c) Show that for every m > nXand IJ=are statistically dependent.

(d) Show that for every m <>Xand IJ=are statistically independent.

(e) Show that Xand IJare statistically independent. Give the simplest characterization you can of the event {n}.

(f) Show that Xand IJ>n are statistically dependent.

Note: The results here are characteristic of most sequences of IID rv s. For most people, this requires some realignment of intuition, since {≥ n} is the union of {m} for all ≥ n, and all of these events are highly dependent on Xn. The right way to think of this is that {≥ n} is the complement of {J n}, which is determined by X1, ... Xn-1. Thus {≥ n} is also determined byX1, ... Xn-1 and is thus independent of Xn. The moral of the story is that thinking of stopping rules as rv s independent of the future is very tricky, even in totally obvious cases such as this.

Text Book: Stochastic Processes: Theory for Applications By Robert G. Gallager.

Request for Solution File

Ask an Expert for Answer!!
Advanced Statistics: Show thatnbspxnnbspand ijgennbsparenbspstatistically
Reference No:- TGS01207554

Expected delivery within 24 Hours