Use the natural filtration of the simple symmetric random walk. The event belongs to , so is a stopping time.
For a positive integer , set . This exit time from the finite interval is integrable: in each block of steps there is a probability at least of all steps being positive, which forces exit if it has not already occurred. Consequently the survival probabilities have a geometric upper bound.
We use the bounded-time optional stopping theorem: if is a martingale and a bounded stopping time, then . Apply it at to and to the square-minus-time martingale of a simple symmetric random walk . The stopped positions lie in , so dominated convergence and monotone convergence giveWriting , the first equation becomes , hence . The second gives . Since , its expectation satisfies for every . ThereforeNevertheless . Thus the infinite mean first passage of a simple symmetric random walk occurs despite almost sure finiteness; using unrestricted optional stopping directly at would be unjustified.
Define the stopped martingaleIt is nonnegative: before the first visit to , the nearest-neighbour random walk is at most , and afterwards the stopped position is . Each is integrable, with . MoreoverThe indicator is -measurable and the increment has conditional mean zero, so is a martingale with .
Part (a) shows almost surely, so every such path eventually has . Thus almost surely. But for every , so there is no convergence in L1. Any possible L1 convergence limit would agree with the almost sure limit. This is a nonnegative martingale with almost sure convergence but no convergence in L1, and hence it is not uniformly integrable.
Because each increment is , the event at time defining is exactly . Therefore, for ,and for this event is empty. Thus is a stopping time for the natural filtration.
On the other hand, . This event has probability , whereas the initial sigma-algebra is trivial, even after completion up to null sets. It therefore cannot belong to . Hence is not a stopping time. Subtracting a deterministic delay from a stopping time can require information from the future.
The time is the waiting time for two consecutive successes in independent fair trials. First note its integrability: if any one of the disjoint pairs is , then . Thus .
Let be the expected additional waiting time with no trailing positive step, and let be the expected additional time when the preceding step was positive. Conditioning on the next independent increment givesA negative step returns either state to state ; a positive step moves state to state and completes the pattern from state . Substitution yields , so . The original process starts in state , and thereforeOverlapping pairs are dependent, so regarding each successive pair as a fresh trial of success probability would give the wrong expectation.
Articles by others on the same topic
There are currently no matching articles.