Martingale method

[16/69%]
Show
LaTeX

Use the exponential martingale to find E[e−λT]\mathbb {E}\left[e^{-\lambda T}\right] where T=inf⁡{t:t≥0,B(t)≥α+βt},λ>0,α>0,β>0T = \inf \left\{ t : t \geq 0, B(t) \geq \alpha +\beta t\right\} , \lambda > 0, \alpha > 0, \beta > 0 and B(⋅)B(\cdot ) SBM.

?

Suppose WW is a Brownian motion and b>0b>0. If S=inf⁡{t>0:Wt=b}S=\inf \left\{ t>0: W_{t}=b\right\}, show that the Laplace transform of the density of SS is given by

E[e−λS]=e−2λb \mathbb {E}\left[e^{-\lambda S}\right]=e^{-\sqrt{2 \lambda } b}
?

If WW is a dd-dimensional Brownian motion started at 0 , find E[T]\mathbb {E}\left[T\right], where TT is the first time WW exits the ball of radius rr centered at the origin.

Hint: Use the fact that ∣Wt∣2−dt\left|W_{t}\right|^{2}-d t is a martingale.

?

Let {ξn}n⩾1\left\{ \xi_{n}\right\}_{n \geqslant 1} be a sequence of independent real random variables. Set Sn=∑k=1nξk,n⩾1S_{n} = \sum_{k = 1}^{n} \xi_{k}, n \geqslant 1. Using martingale methods, prove that the following statements about the series ∑k=1∞ξk\sum_{k = 1}^{\infty } \xi_{k} are equivalent:

  1. the series converges a.s.,

  2. the series converges in probability,

  3. 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 {Xt,t∈T}\left\{ X_{t}, t \in T\right\}, T⊂RT \subset \mathbb {R}, of independent random elements with values in measurable spaces (St,Bt)(\mathrm{S}_{t}, \mathscr {B}_{t}), i.e. Xt:Ω→StX_{t}: \Omega \rightarrow \mathrm{S}_{t}, Xt∈F∣BtX_{t} \in \mathscr {F} \mid \mathscr {B}_{t}, t∈Tt \in T, be given on a probability space (Ω,F,P)(\Omega , \mathscr {F}, \mathbb {P}). Denote

F⩾tX=σ{Xs,s∈T∩[t,∞)} \mathscr {F}_{\geqslant t}^{X} = \sigma \left\{ X_{s}, s \in T \cap [t, \infty )\right\}

Then the "tail" σ\sigma-algebra, i.e. the σ\sigma-algebra G=⋂t∈TF⩾tX\mathscr {G} = \bigcap_{t \in T} \mathscr {F}_{\geqslant t}^{X}, is degenerate. In other words, for every A∈GA \in \mathscr {G} the probability P(A)\mathbb {P}\left(A\right) equals zero or one (if T∩[t,∞)=∅T \cap [t, \infty ) = \varnothing, then F⩾tX:=∅\mathscr {F}_{\geqslant t}^{X}: = \varnothing).

?

(see [12; p. 182]). Let W={Wt,t⩾0}W = \left\{ W_{t}, t \geqslant 0\right\} be an mm-dimensional Brownian motion, where m⩾3m \geqslant 3. Prove that ∥Wt∥→∞\left\| W_{t}\right\| \rightarrow \infty a.s. as t→∞t \rightarrow \infty. Prove that with probability 1 the process WW does not return to the point 0 in any finite time. Explain why for m=1m = 1 these statements are false. What does the corresponding result look like in the case m=2m = 2 ?

?

Let {Zn=exp⁡(rSn−nγ(r));n≥1}\left\{ Z_{n} = \exp \left(rS_{n} - n\gamma (r)\right); n \geq 1\right\} be the generating function martingale of (9.77), where Sn=X1+⋯+XnS_{n} = X_{1} + \cdots + X_{n} and X1,…,XnX_{1}, \ldots , X_{n} are IID with mean X‾<0\overline{X} < 0. Let JJ be the possibly-defective stopping trial for which the process stops after crossing a threshold at α>0\alpha > 0 (there is no negative threshold). Show that exp⁡(r∗α)\exp \left(r^{*}\alpha \right) is an upper bound to the probability of threshold crossing by considering the stopped process {Zn∗;n≥1}\left\{ Z_{n}^{*}; n \geq 1\right\}.

?
Remark.
?

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 E[J]\mathbb {E}\left[J\right] until some fixed pattern, a1,a2,…,aka_{1}, a_{2}, \ldots , a_{k}, of successive binary digits occurs within a sequence of IID binary rv's X1,X2,…X_{1}, X_{2}, \ldots (see Example 4.5.1 and Exercise 5.35 for alternative approaches). We take the stopping time JJ to be the smallest nn for which (Xn−k+1,…,Xn)=(a1,…,ak)(X_{n-k+1}, \ldots , X_{n}) = (a_{1}, \ldots , a_{k}). A mythical casino and sequence of gamblers who follow a prescribed strategy will be used to determine E[J]\mathbb {E}\left[J\right]. The outcomes of the plays (trials), {Xn;n≥1}\left\{ X_{n}; n \geq 1\right\} at the casino is a binary IID sequence for which P(Xn=i)=pi\mathbb {P}\left(X_{n} = i\right) = p_{i} for i∈{0,1}i \in \left\{ 0,1\right\}.

If a gambler places a bet ss on 1 at play nn, the return is s/p1s/p_{1} if Xn=1X_{n} = 1 and 00 otherwise. With a bet ss on 0, the return is s/p0s/p_{0} if Xn=0X_{n} = 0 and 00 otherwise; i.e., the game is fair.

?
(a)

Assume an arbitrary choice of bets on 0 and 1 by the various gamblers on the various trials. Let YnY_{n} be the net gain of the casino on trial nn. Show that E[Yn]=0\mathbb {E}\left[Y_{n}\right] = 0. Let Zn=Y1+Y2+⋯+YnZ_{n} = Y_{1} + Y_{2} + \cdots + Y_{n} be the aggregate gain of the casino over nn trials. Show that for any given pattern of bets, {Zn;n≥1}\left\{ Z_{n}; n \geq 1\right\} is a martingale.

(b)

In order to determine E[J]\mathbb {E}\left[J\right] for a given pattern a1,a2,…,aka_{1}, a_{2}, \ldots , a_{k}, we program our gamblers to bet as follows:

(i) Gambler 1 has an initial capital of 1 which is bet on a1a_{1} at trial 1. If X1=a1X_{1} = a_{1}, the capital grows to 1/pa11/p_{a_{1}}, all of which is bet on a2a_{2} at trial 2. If X2=a2X_{2} = a_{2}, the capital grows to 1/(pa1pa2)1/(p_{a_{1}}p_{a_{2}}), all of which is bet on a3a_{3} 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 kk successive trials (in which case he leaves with 1/[pa1⋯pak]1/\left[p_{a_{1}} \cdots p_{a_{k}}\right]).

(ii) Gambler ℓ\ell, for each ℓ>1\ell > 1, follows the same strategy, but starts at trial ℓ\ell. Note that if the pattern a1,…,aka_{1}, \ldots , a_{k} appears for the first time at trials n−k+1,n−k+2,…,nn-k+1, n-k+2, \ldots , n, i.e., if J=nJ = n, then gambler n−k+1n-k+1 leaves at time nn with capital 1/[p(a1)⋯p(ak)]1/\left[p(a_{1}) \cdots p(a_{k})\right] and gamblers j<n−k+1j < n-k+1 have all lost their capital. We will come back later to investigate the capital at time nn for gamblers n−k+2n-k+2 to nn.

First consider the string a1=0,a2=1a_{1}=0, a_{2}=1 with k=2k = 2. Find the sample values of Z1,Z2,Z3Z_{1}, Z_{2}, Z_{3} for the sample sequence X1=1,X2=0,X3=1,…X_{1} = 1, X_{2} = 0, X_{3} = 1, \ldots. Note that gamblers 1 and 3 have lost their capital, but gambler 2 now has capital 1/p0p11/p_{0}p_{1}. Show that the sample value of the stopping time for this case is J=3J = 3. Given an arbitrary sample value n≥2n \geq 2 for JJ, show that Zn=n−1/p0p1Z_{n} = n - 1/p_{0}p_{1}.

(c)

Find E[ZJ]\mathbb {E}\left[Z_{J}\right] from (a). Use this plus (b) to find E[J]\mathbb {E}\left[J\right].

(d)

Repeat (b) and (c) using the string (a1,…,ak)=(1,1)(a_{1}, \ldots , a_{k}) = (1,1) and initially assuming (X1X2X3)=(011)(X_{1}X_{2}X_{3}) = (011). Be careful about gambler 3 for J=3J = 3. Show that E[J]=1/p12+1/p1\mathbb {E}\left[J\right] = 1/p_{1}^{2} + 1/p_{1}.

(e)

Repeat (b) and (c) for (a1,…,ak)=(1,1,1,0,1,1)(a_{1}, \ldots , a_{k}) = (1,1,1,0,1,1).

(f)

Consider an arbitrary binary string a1,…,aka_{1}, \ldots , a_{k} and condition on J=nJ = n for some n≥kn \geq k. Show that the sample capital of gambler ℓ\ell is then equal to

  • 00 for ℓ<n−k\ell < n-k;

  • 1/[pa1pa2⋯pak]1/\left[p_{a_{1}}p_{a_{2}} \cdots p_{a_{k}}\right] for ℓ=n−k+1\ell = n-k+1;

  • 1/[pa1pa2⋯pai]1/\left[p_{a_{1}}p_{a_{2}} \cdots p_{a_{i}}\right] for ℓ=n−i+1\ell = n-i+1, 1≤i<k1 \leq i < k if (a1,…,ai)=(ak−i+1,…,ak)(a_{1}, \ldots , a_{i}) = (a_{k-i+1}, \ldots , a_{k});

  • 00 for ℓ=n−i+1\ell = n-i+1, 1≤i<k1 \leq i < k if (a1,…,ai)≠(ak−i+1,…,ak)(a_{1}, \ldots , a_{i}) \neq (a_{k-i+1}, \ldots , a_{k}).

Verify that this general formula agrees with (b), (d), and (e).

(g)

For a given binary string (a1,…,ak)(a_{1}, \ldots , a_{k}), and each jj, 1≤j≤k1 \leq j \leq k let Ij=1\mathbb {I}_{j} = 1 if (a1,…,aj)=(ak−j+1,…,ak)(a_{1}, \ldots , a_{j}) = (a_{k-j+1}, \ldots , a_{k}) and let Ij=0\mathbb {I}_{j} = 0 otherwise. Show that

E[J]=∑i=1kIi∏m=1ipam. \mathbb {E}\left[J\right] = \sum _{i=1}^{k} \frac{\mathbb {I}_{i}}{\prod _{m=1}^{i} p_{a_{m}}}.

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 {Sn:n≥0}\left\{ S_{n}: n \geq 0\right\} be a simple symmetric random walk on the integers with S0=kS_{0} = k. Show that SnS_{n} and Sn2−nS_{n}^{2}-n 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 {Sn}\left\{ S_{n}\right\} be a simple random walk with S0=0S_{0} = 0 such that 0<p=P(S1=1)<120 < p = \mathbb {P}\left(S_{1} = 1\right) < \frac{1}{2}. Use de Moivre's martingale to show that E[sup⁡mSm]≤p/(1−2p)\mathbb {E}\left[\sup_{m} S_{m}\right] \leq p /(1-2 p). Show further that this inequality may be replaced by an equality.

?

Let X={Xn:n≥0}X = \left\{ X_{n}: n \geq 0\right\} be a Markov chain with state space {0,1,…,b}\left\{ 0,1, \ldots , b\right\}, such that i→0,bi \rightarrow 0, b for i∈{1,2,…,b−1}i \in \left\{ 1,2, \ldots , b-1\right\}. If XX is also a martingale, show that 0 and bb are absorbing, and that, given X0X_{0}, the probability of absorption at bb is X0/bX_{0} / b.

?

Let X={X(t):t≥0}X = \left\{ X(t): t \geq 0\right\} be a birth-death process with parameters λi,μi\lambda_{i}, \mu_{i}, where λi=0\lambda_{i} = 0 if and only if i=0i = 0. Define h(0)=0,h(1)=1h(0) = 0, h(1) = 1, and

h(j)=1+∑i=1j−1μ1μ2⋯μiλ1λ2⋯λi,j≥2 h(j) = 1+\sum _{i = 1}^{j-1} \frac{\mu _{1} \mu _{2} \cdots \mu _{i}}{\lambda _{1} \lambda _{2} \cdots \lambda _{i}}, \quad j \geq 2
?
(a)

Show that h(X(t))h(X(t)) constitutes a martingale with respect to the filtration Ft=σ({X(u):0≤u≤t})\mathcal{F}_{t} = \sigma (\left\{ X(u): 0 \leq u \leq t\right\} ), whenever E[h(X(t))]<∞\mathbb {E}\left[h(X(t))\right] < \infty for all tt. (You may assume that the forward equations are satisfied.)

(b)

Fix nn, and let m<nm < n; let π(m)\pi (m) be the probability that the process is absorbed at 0 before it reaches size nn, having started at size mm. Show that π(m)=1−{h(m)/h(n)}\pi (m) = 1-\left\{ h(m) / h(n)\right\}.

Here is a gambling system for playing a fair game. Choose a sequence x1,x2,…,xnx_{1}, x_{2}, \ldots , x_{n} 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 xn+1(=x1+xn)x_{n+1}\left( = x_{1}+x_{n}\right) 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 11, the game terminates with a profit of ∑1nxi\sum_{1}^{n} x_{i}, 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 £6000£ 6000.)

?

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 G1,G2,…G_{1}, G_{2}, \ldots, each with an initial fortune of $1\$ 1. A croupier tosses a coin repeatedly. For each nn, gambler GnG_{n} bets as follows. Just before the nnth toss he stakes his $1\$ 1 on the event that the nnth toss shows heads. The game is assumed fair, so that he receives a total of $p−1\$ p^{-1} if he wins, where pp 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 SnS_{n} be the casino's profit (losses count negative) after the nnth toss. Show that SnS_{n} is a martingale. Let NN be the number of tosses before the first appearance of HHH ; show that NN is a stopping time and hence find E[N]\mathbb {E}\left[N\right].

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 n=1,2,…,52n = 1,2, \ldots , 52 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 RnR_{n} be the number of red cards remaining face down after the nnth card has been turned over. Show that Xn=Rn/(52−n),0≤n<52X_{n} = R_{n} /(52-n), 0 \leq n < 52, defines a martingale. Show that there is no strategy for the player which results in a probability of winning different from 12\frac{1}{2}.

?

In a cloakroom there are KK coats belonging to KK 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 NN be the number of rounds of attempts until everyone has left. Show that E[N]=K\mathbb {E}\left[N\right] = K and Var⁡[N]≤K\operatorname {Var}\left[N\right] \leq K.

?

An insurance company receives premiums (net of costs) at rate ρ\rho per unit time. Claims X1,X2,…X_{1}, X_{2}, \ldots are independent random variables with the exponential distribution with parameter μ\mu, and they arrive at the times of a Poisson process of rate λ\lambda (assume the usual independence, as well as λ,μ,ρ>0)\lambda , \mu , \rho > 0). Let Y(t)Y(t) be the assets of the company at time tt where Y(0)=y>0Y(0) = y > 0. Show that

P(Y(t)≤0 for some t>0)={(1−θμ)e−θy if θ>01 otherwise  \mathbb {P}\left(Y(t) \leq 0 \text{ for some } t > 0\right) = \begin{cases} \left(1-\frac{\theta }{\mu }\right) e^{-\theta y} & \text{ if } \theta > 0 \\ 1 & \text{ otherwise }\end{cases}

where θ=μ−(λ/ρ)\theta = \mu -(\lambda / \rho ).

?

References

[AtLa06] Athreya K.B., Lahiri S.N. Measure Theory and Probability Theory. Springer, 2006.
[Bas11] Bass R.F. Stochastic Processes. Cambridge University Press, 2011.
[БуШи05] Булинский А.В., Ширяев А.Н. Теория случайных процессов. ФИЗМАТЛИТ, 2005.
[Gal13] Gallager R.G. Stochastic Processes: Theory for Applications. Cambridge University Press, 2013.
[GrSt20] Grimmett G.R., Stirzaker D.R. Probability and Random Processes. 4th ed., Oxford University Press, 2020.