跳到主要内容

東京大学 新領域創成科学研究科 メディカル情報生命専攻 2022年8月実施 問題11

Author​

zephyr, 祭音Myyura

Description​

Let {xt∣t=0,1,2,…}\{x_t | t = 0, 1, 2, \ldots\} be a random sequence of non-negative integers generated by the following rules.

(i) If xt>0x_t > 0, xt+1=xt+1x_{t+1} = x_t + 1 with probability pp, and xt+1=xt−1x_{t+1} = x_t - 1 with probability q=(1−p)q = (1 - p).

(ii) If xt=0x_t = 0, xt+1=0x_{t+1} = 0 with probability 1.

In the following, p≠qp \neq q is assumed. Further, we define uk(T)u_k^{(T)} as the probability that xT=0x_T = 0 at time t=Tt = T with initial value x0=kx_0 = k (kk: a nonnegative integer). Answer the following questions.

(1) Answer the probability that x3=2x_3 = 2 given x0=1x_0 = 1.

(2) Answer the probability that x4=0x_4 = 0 given x0=2x_0 = 2.

(3) Express uk(T)u_k^{(T)} using uk+1(T−1)u_{k+1}^{(T-1)} and uk−1(T−1)u_{k-1}^{(T-1)} (k>0k > 0, T≥1T \geq 1).

(4) Let uk=lim⁡T→∞uk(T)u_k = \lim_{T \to \infty} u_k^{(T)}. Derive the equations that the uku_ks satisfy using (3).

(5) Answer the condition for pp that the equations of (4) have a solution uku_k with lim⁡k→∞uk=0\lim_{k \to \infty} u_k = 0, as well as the solution uku_k (Examine the case: uk=zku_k = z^k).

题目描述​

随机序列 {xt∣t=0,1,2,…}\{x_t\mid t=0,1,2,\ldots\} 取非负整数值,并按下列规则演化:

  • 若 xt>0x_t>0,则以概率 pp 令 xt+1=xt+1x_{t+1}=x_t+1,以概率 q=1−pq=1-p 令 xt+1=xt−1x_{t+1}=x_t-1;
  • 若 xt=0x_t=0,则以概率 1 保持 xt+1=0x_{t+1}=0。

以下假设 p≠qp\ne q。对非负整数初值 x0=kx_0=k,定义

uk(T)=P(xT=0∣x0=k).u_k^{(T)}=P(x_T=0\mid x_0=k).

回答下列问题:

  1. 求 P(x3=2∣x0=1)P(x_3=2\mid x_0=1)。

  2. 求 P(x4=0∣x0=2)P(x_4=0\mid x_0=2)。

  3. 对 k>0,T≥1k>0,T\ge1,用 uk+1(T−1)u_{k+1}^{(T-1)} 与 uk−1(T−1)u_{k-1}^{(T-1)} 表示 uk(T)u_k^{(T)}。

  4. 令

    uk=lim⁡T→∞uk(T),u_k=\lim_{T\to\infty}u_k^{(T)},

    由第 3 问推出 {uk}\{u_k\} 满足的方程及边界条件。

  5. 求使上述方程存在满足 lim⁡k→∞uk=0\lim_{k\to\infty}u_k=0 的解时 pp 的条件,并求相应 uku_k;可尝试代入 uk=zku_k=z^k。

Kai​

(1) The probability that x3=2x_3 = 2 given x0=1x_0 = 1​

To find the probability that x3=2x_3 = 2 given x0=1x_0 = 1, we need to consider the different paths the process can take to reach from 1 to 2 in three steps.

The paths and their probabilities are:

  1. 1→2→3→21 \to 2 \to 3 \to 2: probability p⋅p⋅qp \cdot p \cdot q
  2. 1→2→1→21 \to 2 \to 1 \to 2: probability p⋅q⋅pp \cdot q \cdot p

Adding these probabilities together, we get:

P(x3=2∣x0=1)=p2q+p2q=2p2q=2p2(1−p)=2p2−2p3P(x_3 = 2 | x_0 = 1) = p^2q + p^2q = 2p^2q = 2p^2(1-p) = 2p^2 - 2p^3

(2) The probability that x4=0x_4 = 0 given x0=2x_0 = 2​

To find the probability that x4=0x_4 = 0 given x0=2x_0 = 2, we consider the paths to reach 0 from 2 in four steps.

The paths and their probabilities are:

  1. 2→1→0→0→02 \to 1 \to 0 \to 0 \to 0: probability q2q^2 (state 00 is absorbing)
  2. 2→1→2→1→02 \to 1 \to 2 \to 1 \to 0: probability q⋅p⋅q⋅qq \cdot p \cdot q \cdot q
  3. 2→3→2→1→02 \to 3 \to 2 \to 1 \to 0: probability p⋅q⋅q⋅qp \cdot q \cdot q \cdot q

Adding these probabilities together, we get:

P(x4=0∣x0=2)=q2+2pq3=q2(1+2pq)P(x_4 = 0 | x_0 = 2) = q^2 + 2pq^3 = q^2(1+2pq)

(3) Express uk(T)u_k^{(T)} using uk+1(T−1)u_{k+1}^{(T-1)} and uk−1(T−1)u_{k-1}^{(T-1)} (k>0k > 0, T≥1T \geq 1)​

For k>0k > 0, the probability that xT=0x_T = 0 given x0=kx_0 = k can be written in terms of the probabilities at T−1T-1:

uk(T)=p⋅uk+1(T−1)+q⋅uk−1(T−1)=p⋅uk+1(T−1)+(1−p)⋅uk−1(T−1)u_k^{(T)} = p \cdot u_{k+1}^{(T-1)} + q \cdot u_{k-1}^{(T-1)} = p \cdot u_{k+1}^{(T-1)} + (1-p) \cdot u_{k-1}^{(T-1)}

(4) Let uk=lim⁡T→∞uk(T)u_k = \lim_{T \to \infty} u_k^{(T)}. Derive the equations that the uku_ks satisfy using (3)​

Since absorption is permanent, uk(T)u_k^{(T)} is nondecreasing in TT and bounded above by 1, so its limit exists. Taking limits gives

uk=p⋅uk+1+q⋅uk−1=p⋅uk+1+(1−p)⋅uk−1u_k = p \cdot u_{k+1} + q \cdot u_{k-1} = p \cdot u_{k+1} + (1-p) \cdot u_{k-1}

Also, u0=1u_0=1 because state 00 is absorbing.

(5) The condition for pp that the equations of (4) have a solution uku_k with lim⁡k→∞uk=0\lim_{k \to \infty} u_k = 0, as well as the solution uku_k (Examine the case: uk=zku_k = z^k)​

First suppose 0<p<10<p<1 and p≠1/2p\ne1/2. Assume a solution of the form uk=zku_k = z^k:

zk=p⋅zk+1+(1−p)⋅zk−1z^k = p \cdot z^{k+1} + (1-p) \cdot z^{k-1}

Dividing by zk−1z^{k-1}, we get:

z=pz2+(1−p)z = pz^2 + (1-p)

This is a quadratic equation in zz:

pz2−z+q=0=(z−1)(pz−q)pz^2-z+q=0=(z-1)(pz-q)

The roots of this equation are:

z=1,z=qpz=1,\qquad z=\frac{q}{p}

Thus the general solution is uk=C1+C2(q/p)ku_k=C_1+C_2(q/p)^k. The conditions u0=1u_0=1 and lim⁡k→∞uk=0\lim_{k\to\infty}u_k=0 can hold exactly when q/p<1q/p<1, i.e. p>1/2p>1/2. They then give C1=0C_1=0, C2=1C_2=1, so

uk=(qp)ku_k=\left(\frac{q}{p}\right)^k

When 0<p<1/20<p<1/2, boundedness forces uk=1u_k=1, which does not tend to 0 as k→∞k\to\infty. At p=0p=0, the process deterministically reaches 0 and again uk=1u_k=1. At p=1p=1, u0=1u_0=1 and uk=0u_k=0 for every k≥1k\ge1. Thus the full parameter range is 1/2<p≤11/2<p\le1.

Knowledge​

随机过程 马尔可夫链 概率计算

难点解题思路​

  • 分析每个时间步的状态变化及其概率。
  • 考虑随机过程的限制条件如 xt=0x_t = 0 时的吸收状态。

解题技巧和信息​

  • 分步计算状态转移概率。
  • 利用马尔可夫链的平稳状态来解答长时间行为问题。

重点词汇​

  • random sequence 随机序列
  • probability 概率
  • Markov chain 马尔可夫链
  • absorbing state 吸收状态

参考资料​

  1. Ross, S. M. (2007). Introduction to Probability Models. Chapter 4: Markov Chains.