MathIsimple

Stochastic Processes – Problem 30: Prove the following results: (a) If , then is a martingale

Question

Consider the asymmetric random walk, i.e., P(ξi=1)=pP(\xi_i=1)=p, P(ξi=1)=q=1pP(\xi_i=-1)=q=1-p, and pqp\neq q. Prove the following results:

(a) If ϕ(y)=[1pp]y\phi(y)=\left[\frac{1-p}{p}\right]^{y}, then ϕ(Sn)\phi(S_n) is a martingale.

(b) With initial position S0=xS_0=x, let Tz=inf{n:Sn=z}T_z=\inf\{n:S_n=z\}. Then for a<x<ba<x<b, Px(Ta<Tb)=ϕ(b)ϕ(x)ϕ(b)ϕ(a),Px(Tb<Ta)=ϕ(x)ϕ(a)ϕ(b)ϕ(a).P_x(T_a<T_b)=\frac{\phi(b)-\phi(x)}{\phi(b)-\phi(a)},\quad P_x(T_b<T_a)=\frac{\phi(x)-\phi(a)}{\phi(b)-\phi(a)}.

For the following two parts, assume 12<p<1\frac{1}{2}<p<1:

(c) If a<0a<0, then P(minnSna)=P(Ta<)=[1pp]aP\left(\min_n S_n \leq a\right)=P(T_a<\infty)=\left[\frac{1-p}{p}\right]^{-a}.

(d) If b>0b>0, then P(Tb<)=1P(T_b<\infty)=1, and E(Tb)=b2p1E(T_b)=\frac{b}{2p-1}.

Step-by-step solution

Let Sn=S0+k=1nξkS_n=S_0+\sum_{k=1}^n\xi_k, where P(ξk=1)=p,P(ξk=1)=q=1p,pq.P(\xi_k=1)=p,\qquad P(\xi_k=-1)=q=1-p,\qquad p\ne q. Define ϕ(x):=(qp)x.\phi(x):=\left(\frac{q}{p}\right)^x.

(a) Martingale property of ϕ(Sn)\phi(S_n). Because Sn+1=Sn+ξn+1S_{n+1}=S_n+\xi_{n+1}, E[ϕ(Sn+1)Fn]=ϕ(Sn)E ⁣[(qp)ξn+1]=ϕ(Sn)(pqp+qpq)=ϕ(Sn).E[\phi(S_{n+1})\mid\mathcal F_n] =\phi(S_n)E\!\left[\left(\frac{q}{p}\right)^{\xi_{n+1}}\right] =\phi(S_n)\Bigl(p\frac{q}{p}+q\frac{p}{q}\Bigr) =\phi(S_n). Hence (ϕ(Sn))(\phi(S_n)) is a martingale.

(b) Hitting probabilities on [a,b][a,b], a<x<ba<x<b. Let τ:=TaTb,Tz:=inf{n0:Sn=z}.\tau:=T_a\wedge T_b, \qquad T_z:=\inf\{n\ge0:S_n=z\}. By optional stopping for bounded stopping times τm\tau\wedge m, then mm\to\infty, Ex[ϕ(Sτ)]=ϕ(x).E_x[\phi(S_\tau)]=\phi(x). Since Sτ{a,b}S_\tau\in\{a,b\}, letting u=Px(Ta<Tb)u=P_x(T_a<T_b), we have ϕ(x)=uϕ(a)+(1u)ϕ(b),\phi(x)=u\phi(a)+(1-u)\phi(b), thus Px(Ta<Tb)=ϕ(b)ϕ(x)ϕ(b)ϕ(a),Px(Tb<Ta)=ϕ(x)ϕ(a)ϕ(b)ϕ(a).P_x(T_a<T_b)=\frac{\phi(b)-\phi(x)}{\phi(b)-\phi(a)}, \qquad P_x(T_b<T_a)=\frac{\phi(x)-\phi(a)}{\phi(b)-\phi(a)}.

Now assume p>1/2p>1/2 (so q/p<1q/p<1).

(c) Probability of ever hitting level a<0a<0. Apply part (b) with upper barrier bb\to\infty, starting from x=0x=0: P0(Ta<)=limbϕ(b)ϕ(0)ϕ(b)ϕ(a)=010ϕ(a)=ϕ(a)1=(qp)a.P_0(T_a<\infty)=\lim_{b\to\infty}\frac{\phi(b)-\phi(0)}{\phi(b)-\phi(a)} =\frac{0-1}{0-\phi(a)} =\phi(a)^{-1} =\left(\frac{q}{p}\right)^{-a}. Since {minnSna}={Ta<}\{\min_n S_n\le a\}=\{T_a<\infty\}, P ⁣(minnSna)=(qp)a.P\!\left(\min_n S_n\le a\right)=\left(\frac{q}{p}\right)^{-a}.

(d) Hitting b>0b>0: probability and expectation. Because the walk has positive drift E[ξ1]=pq=2p1>0,E[\xi_1]=p-q=2p-1>0, it tends to ++\infty almost surely, hence P0(Tb<)=1.P_0(T_b<\infty)=1. For expectation, define Mn:=Sn(pq)n.M_n:=S_n-(p-q)n. Then (Mn)(M_n) is a martingale. Apply optional stopping at τb:=Tb\tau_b:=T_b: E[Mτb]=E[M0]=0E[Sτb](pq)E[τb]=0.E[M_{\tau_b}]=E[M_0]=0 \quad\Longrightarrow\quad E[S_{\tau_b}]-(p-q)E[\tau_b]=0. Since Sτb=bS_{\tau_b}=b a.s., E[Tb]=bpq=b2p1.E[T_b]=\frac{b}{p-q}=\frac{b}{2p-1}. This proves all four claims.

Additional justification for optional stopping in part (b): use the bounded stopping time τm:=τm,τ=TaTb.\tau_m:=\tau\wedge m,\qquad \tau=T_a\wedge T_b. Because aSτmba\le S_{\tau_m}\le b, the variable ϕ(Sτm)\phi(S_{\tau_m}) is bounded uniformly in mm, so dominated convergence applies. Therefore Ex[ϕ(Sτm)]=ϕ(x)  Ex[ϕ(Sτ)]=ϕ(x).E_x[\phi(S_{\tau_m})]=\phi(x)\ \Longrightarrow\ E_x[\phi(S_{\tau})]=\phi(x). This removes any integrability ambiguity and gives a fully rigorous passage to the limit.

For part (d), one can also derive E[Tb]=b/(2p1)E[T_b]=b/(2p-1) from Wald's identity: E[STbm]=E[Tbm]E[ξ1],E[S_{T_b\wedge m}]=E[T_b\wedge m]\,E[\xi_1], then let mm\to\infty using monotone convergence and the fact that STb=bS_{T_b}=b almost surely when p>1/2p>1/2.

Final answer

QED.

Marking scheme

The following is the grading rubric.

1. Checkpoints (max 7 pts total)

  • (a) Prove ϕ(Sn)\phi(S_n) is a martingale
  • Compute the key expectation: Show E[(1pp)ξi]=1E[(\frac{1-p}{p})^{\xi_i}] = 1 and derive E[ϕ(Sn+1)Fn]=ϕ(Sn)E[\phi(S_{n+1})|\mathcal{F}_n] = \phi(S_n). [1 pt]
  • (b) Prove the first-passage probability formula
  • Establish the equation (OST): Write ϕ(x)=Pϕ(a)+(1P)ϕ(b)\phi(x) = P\phi(a) + (1-P)\phi(b). [1 pt]
  • Solve for the probability: Correctly solve for Px(Ta<Tb)P_x(T_a < T_b). [1 pt]
  • (c) Prove the distribution of minSn\min S_n
  • Limit analysis: State q/p<1q/p < 1 implies ϕ(b)0\phi(b) \to 0, substitute into (b). [1 pt]
  • (d) Prove P(Tb<)=1P(T_b<\infty)=1 and E(Tb)=b/(2p1)E(T_b)=b/(2p-1)
  • Probability equals 1: State ϕ(a)\phi(a) \to \infty as aa \to -\infty, take limit. [1 pt]
  • E(Tb)E(T_b) computation (score one chain):
  • Chain A: Construct Mn=Sn(2p1)nM_n = S_n - (2p-1)n as martingale (1 pt), apply OST to get E(Tb)=b/(2p1)E(T_b) = b/(2p-1) (1 pt).
  • Chain B: Invoke Wald's identity (1 pt), substitute and solve (1 pt).

Total (max 7)

2. Zero-credit items

  • (a): Only copying ϕ(y)\phi(y) definition without computation.
  • (d): Guessing from physical intuition without probabilistic argument.
  • Only restating conclusions without intermediate steps.

3. Deductions

  • Not mentioning p>1/2p > 1/2 when taking limits in (c) or (d). (-1 pt)
  • Sign error in drift computation. (-1 pt)
  • Confusing E[ϕ(ST)]=ϕ(E[ST])E[\phi(S_T)] = \phi(E[S_T]). (-1 pt)
Ask AI ✨