Martingale method
[16/69%]Use the exponential martingale to find where and SBM.
Suppose is a Brownian motion and . If , show that the Laplace transform of the density of is given by
If is a -dimensional Brownian motion started at 0 , find , where is the first time exits the ball of radius centered at the origin.
Hint: Use the fact that is a martingale.
Let be a sequence of independent real random variables. Set . Using martingale methods, prove that the following statements about the series are equivalent:
-
the series converges a.s.,
-
the series converges in probability,
-
the series converges in distribution.
Note that by Kolmogorov's zero-one law (Theorem 6 of Chapter III) this series converges or diverges with probability one.
Theorem 6 of Chapter III (zero-one law). Let a family , , of independent random elements with values in measurable spaces , i.e. , , , be given on a probability space . Denote
Then the "tail" -algebra, i.e. the -algebra , is degenerate. In other words, for every the probability equals zero or one (if , then ).
(see [12; p. 182]). Let be an -dimensional Brownian motion, where . Prove that a.s. as . Prove that with probability 1 the process does not return to the point 0 in any finite time. Explain why for these statements are false. What does the corresponding result look like in the case ?
Let be the generating function martingale of (9.77), where and are IID with mean . Let be the possibly-defective stopping trial for which the process stops after crossing a threshold at (there is no negative threshold). Show that is an upper bound to the probability of threshold crossing by considering the stopped process .
The purpose of this exercise is to illustrate that the stopped process can yield useful upper bounds even when the stopping trial is defective.
This exercise uses a martingale to find the expected number of successive trials until some fixed pattern, , of successive binary digits occurs within a sequence of IID binary rv's (see Example 4.5.1 and Exercise 5.35 for alternative approaches). We take the stopping time to be the smallest for which . A mythical casino and sequence of gamblers who follow a prescribed strategy will be used to determine . The outcomes of the plays (trials), at the casino is a binary IID sequence for which for .
If a gambler places a bet on 1 at play , the return is if and otherwise. With a bet on 0, the return is if and otherwise; i.e., the game is fair.
Assume an arbitrary choice of bets on 0 and 1 by the various gamblers on the various trials. Let be the net gain of the casino on trial . Show that . Let be the aggregate gain of the casino over trials. Show that for any given pattern of bets, is a martingale.
In order to determine for a given pattern , we program our gamblers to bet as follows:
(i) Gambler 1 has an initial capital of 1 which is bet on at trial 1. If , the capital grows to , all of which is bet on at trial 2. If , the capital grows to , all of which is bet on at trial 3. Gambler 1 continues in this way until either losing at some trial (in which case he leaves with no money) or winning on successive trials (in which case he leaves with ).
(ii) Gambler , for each , follows the same strategy, but starts at trial . Note that if the pattern appears for the first time at trials , i.e., if , then gambler leaves at time with capital and gamblers have all lost their capital. We will come back later to investigate the capital at time for gamblers to .
First consider the string with . Find the sample values of for the sample sequence . Note that gamblers 1 and 3 have lost their capital, but gambler 2 now has capital . Show that the sample value of the stopping time for this case is . Given an arbitrary sample value for , show that .
Find from (a). Use this plus (b) to find .
Repeat (b) and (c) using the string and initially assuming . Be careful about gambler 3 for . Show that .
Repeat (b) and (c) for .
Consider an arbitrary binary string and condition on for some . Show that the sample capital of gambler is then equal to
-
for ;
-
for ;
-
for , if ;
-
for , if .
Verify that this general formula agrees with (b), (d), and (e).
For a given binary string , and each , let if and let otherwise. Show that
Note that this is the same as the final result in Exercise 4.28. The argument is shorter here, but more motivated and insightful there. Both approaches are useful and lead to simple generalizations.
Let be a simple symmetric random walk on the integers with . Show that and are martingales. Making assumptions similar to those of de Moivre (see Example (12.1.4)), find the probability of ruin and the expected duration of the game for the gambler's ruin problem.
Let be a simple random walk with such that . Use de Moivre's martingale to show that . Show further that this inequality may be replaced by an equality.
Let be a Markov chain with state space , such that for . If is also a martingale, show that 0 and are absorbing, and that, given , the probability of absorption at is .
Let be a birth-death process with parameters , where if and only if . Define , and
Show that constitutes a martingale with respect to the filtration , whenever for all . (You may assume that the forward equations are satisfied.)
Fix , and let ; let be the probability that the process is absorbed at 0 before it reaches size , having started at size . Show that .
Here is a gambling system for playing a fair game. Choose a sequence of positive numbers.
Wager the sum of the first and last numbers on an evens bet. If you win, delete those two numbers; if you lose, append their sum as an extra term at the right-hand end of the sequence.
You play iteratively according to the above rule. If the sequence ever contains one term only, you wager that amount on an evens bet. If you win, you delete the term, and if you lose you append it to the sequence to obtain two terms.
Show that, with probability , the game terminates with a profit of , and that the time until termination has finite mean.
This looks like another clever strategy. Show that the mean size of your maximum deficit is infinite. (When Henry Labouchere was sent down from Trinity College, Cambridge, in 1852, his gambling debts exceeded .)
Here is a martingale approach to the question of determining the mean number of tosses of a coin before the first appearance of the sequence HHH. A large casino contains infinitely many gamblers , each with an initial fortune of . A croupier tosses a coin repeatedly. For each , gambler bets as follows. Just before the th toss he stakes his on the event that the th toss shows heads. The game is assumed fair, so that he receives a total of if he wins, where is the probability of heads. If he wins this gamble, then he repeatedly stakes his entire current fortune on heads, at the same odds as his first gamble. At the first subsequent tail he loses his fortune and leaves the casino, penniless. Let be the casino's profit (losses count negative) after the th toss. Show that is a martingale. Let be the number of tosses before the first appearance of HHH ; show that is a stopping time and hence find .
Now adapt this scheme to calculate the mean time to the first appearance of the sequence HTH.
The game 'Red Now' may be played by a single player with a well shuffled conventional pack of 52 playing cards. At times the player turns over a new card and observes its colour. Just once in the game he must say, just before exposing a card, "Red Now". He wins the game if the next exposed card is red. Let be the number of red cards remaining face down after the th card has been turned over. Show that , defines a martingale. Show that there is no strategy for the player which results in a probability of winning different from .
In a cloakroom there are coats belonging to people who make an attempt to leave by picking a coat at random. Those who pick their own coat leave, the rest return the coats and try again at random. Let be the number of rounds of attempts until everyone has left. Show that and .
An insurance company receives premiums (net of costs) at rate per unit time. Claims are independent random variables with the exponential distribution with parameter , and they arrive at the times of a Poisson process of rate (assume the usual independence, as well as . Let be the assets of the company at time where . Show that
where .