跳到主要内容

東京大学 情報理工学研究科 2023年8月実施 数学 第3問

Author

zephyr

Description

Consider a particle moving on the coordinate plane, and denote the location of the particle at time t{0,1,2,}t \in \{0, 1, 2, \dots\} by (Xt,Yt)(X_t, Y_t). The initial location of the particle is (X0,Y0)=(0,0)(X_0, Y_0) = (0, 0). Also, if (Xt,Yt)=(a,b)(X_t, Y_t) = (a, b), then (Xt+1,Yt+1)=(a+1,b)(X_{t+1}, Y_{t+1}) = (a+1, b) with probability pp, (Xt+1,Yt+1)=(a,b+1)(X_{t+1}, Y_{t+1}) = (a, b+1) with probability qq, and (Xt+1,Yt+1)=(a,b)(X_{t+1}, Y_{t+1}) = (a, b) with probability 1pq1 - p - q. Here, it is assumed that p,q>0p, q > 0, p+q<1p + q < 1, and the movements of the particle at different time points are independent. Let (X,Y)(X, Y) denote the location of the particle such that (Xt+1,Yt+1)=(Xt,Yt)(X_{t+1}, Y_{t+1}) = (X_t, Y_t) for the first time. Answer the following questions.

(1) Show that the probability that (X,Y)=(1,2)(X, Y) = (1, 2) is 3pq2(1pq)3pq^2(1 - p - q).

(2) For non-negative integers nn, find the probability that X+Y=nX + Y = n.

(3) For non-negative integers nn, let fnf_n denote the probability that X=nX = n.

  • (a) Find f0f_0.
  • (b) Express the probability that Xn+1X \geq n + 1 given the condition XnX \geq n, using f0f_0.
  • (cc) Show that fn=(1f0)nf0f_n = (1 - f_0)^n f_0.

(4) Express the expectation of XX using pp and qq.

(5) Express the correlation coefficient between XX and YY

E[(XμX)(YμY)]E[(XμX)2]E[(YμY)2]\frac{\mathbb{E}[(X - \mu_X)(Y - \mu_Y)]}{\sqrt{\mathbb{E}[(X - \mu_X)^2]\mathbb{E}[(Y - \mu_Y)^2]}}

using pp and qq, where μX=E[X]\mu_X = \mathbb{E}[X] denotes the expectation of XX and μY=E[Y]\mu_Y = \mathbb{E}[Y] denotes the expectation of YY.

题目描述

粒子从 (X0,Y0)=(0,0)(X_0,Y_0)=(0,0) 出发。每个离散时刻独立地:

  • 以概率 pp 向右移动一格;
  • 以概率 qq 向上移动一格;
  • 以概率 1pq1-p-q 停留原地,

其中 p,q>0p,q>0p+q<1p+q<1。在第一次发生停留时停止,记此时位置为 (X,Y)(X,Y)。回答下列问题。

(1)证明

P((X,Y)=(1,2))=3pq2(1pq).P((X,Y)=(1,2))=3pq^2(1-p-q).

(2)对非负整数 nn,求 P(X+Y=n)P(X+Y=n)

(3)对非负整数 nn,令 fn=P(X=n)f_n=P(X=n)

  • (a)求 f0f_0
  • (b)用 f0f_0 表示条件概率 P(Xn+1Xn)P(X\ge n+1\mid X\ge n)
  • (c)证明 fn=(1f0)nf0f_n=(1-f_0)^nf_0

(4)用 p,qp,q 表示 E[X]\mathbb E[X]

(5)用 p,qp,q 表示 X,YX,Y 的相关系数

E[(XμX)(YμY)]E[(XμX)2]E[(YμY)2],\frac{\mathbb E[(X-\mu_X)(Y-\mu_Y)]} {\sqrt{\mathbb E[(X-\mu_X)^2]\, \mathbb E[(Y-\mu_Y)^2]}},

其中 μX=E[X]\mu_X=\mathbb E[X]μY=E[Y]\mu_Y=\mathbb E[Y]

考点

  • 停止时间与组合概率:在首次停留前枚举右移、上移的排列,并乘停止概率。
  • 几何分布:总移动步数在每步以固定概率停止,横坐标也可通过条件成功过程得到几何型分布。
  • 期望与方差:利用概率母函数、全期望或多项式混合计算坐标矩。
  • 相关系数:识别共同随机停止时间造成的依赖,求协方差并标准化。

Kai

(1)

To calculate the probability that (X,Y)=(1,2)(X, Y) = (1, 2), we consider the steps the particle must take to reach the position (1,2)(1, 2) for the first time. The particle must take one step to the right and two steps up. Since each move is independent and the probability of moving right is pp, moving up is qq, and staying in the same place is 1pq1 - p - q, the possible sequences of moves that result in the particle reaching (1,2)(1, 2) can be:

  1. Move right, then move up twice.
  2. Move up, move right, then move up again.
  3. Move up twice, then move right.

The probability for each of these sequences is pqq(1pq)p \cdot q \cdot q \cdot (1 - p - q) because the particle has to stay at least once before completing the sequence. There are 3 such sequences, so the total probability is:

P((X,Y)=(1,2))=3pq2(1pq)P((X, Y) = (1, 2)) = 3pq^2(1 - p - q)

(2)

To find the probability that X+Y=nX + Y = n, note that this sum represents the total number of steps taken by the particle (where each step is either to the right or upwards). The total number of steps nn can be distributed between XX (right steps) and YY (up steps). If X=kX = k, then Y=nkY = n - k, and the probability of taking kk steps to the right and nkn - k steps up is:

P(X=k,Y=nk)=(nk)pkqnk(1pq)P(X = k, Y = n - k) = \binom{n}{k} p^k q^{n-k} (1 - p - q)

Summing over all possible values of kk:

P(X+Y=n)=(1pq)k=0n(nk)pkqnkP(X + Y = n) = (1 - p - q) \sum_{k=0}^{n} \binom{n}{k} p^k q^{n-k}

By the binomial theorem, k=0n(nk)pkqnk=(p+q)n\sum_{k=0}^{n} \binom{n}{k} p^k q^{n-k} = (p + q)^n, so:

P(X+Y=n)=(1pq)(p+q)nP(X + Y = n) = (1 - p - q) (p + q)^n

Simplified:

P(X+Y=n)=(p+q)n(1pq)P(X + Y = n) = (p + q)^n (1 - p - q)

(3)

(a) Find f0f_0

To find f0f_0, we need to calculate the probability that the particle never moves to the right, i.e., X=0X = 0. This occurs if the particle only moves up or stays in place until it reaches a position where it never moves again. Therefore, f0f_0 is the sum of the probabilities of all possible scenarios where the particle stays in place or moves up any number of times and then stops:

f0=k=0qk(1pq)=1pq1qf_0 = \sum_{k=0}^{\infty} q^k(1 - p - q) = \frac{1 - p - q}{1 - q}

(b) Express the probability that Xn+1X \geq n + 1 given the condition XnX \geq n, using f0f_0

The probability that Xn+1X \geq n + 1 given that XnX \geq n is the probability that the particle does not stop after nn steps, given that it hasn't stopped at nn steps:

P(Xn+1)P(Xn)=(1f0)n+1(1f0)n=1f0\frac{P(X \geq n + 1)}{P(X \geq n)} = \frac{(1 - f_0)^{n+1}}{(1 - f_0)^n} = 1 - f_0

(cc) Show that fn=(1f0)nf0f_n = (1 - f_0)^n f_0

The probability that X=nX = n is the probability that the particle does not stop before nn steps and stops exactly at the nn-th step. This is given by:

fn=P(No stop in first n steps)×P(Stop at the n+1-th step)f_n = P(\text{No stop in first } n \text{ steps}) \times P(\text{Stop at the } n+1\text{-th step})

Since f0=1pq1qf_0 = \frac{1 - p - q}{1 - q}, the stopping probability at step n+1n+1 is f0f_0 and the probability of not stopping is (1f0)n(1 - f_0)^n. Therefore:

fn=(1f0)nf0=(11pq1q)n1pq1qf_n = (1 - f_0)^n f_0 = \left(1 - \frac{1 - p - q}{1 - q}\right)^n \frac{1 - p - q}{1 - q}

(4)

The expectation E[X]\mathbb{E}[X] is the sum of nfnn \cdot f_n, where fnf_n is the probability of stopping at exactly nn steps:

E[X]=n=1nfn=n=1n(11pq1q)n1pq1q\mathbb{E}[X] = \sum_{n=1}^{\infty} n f_n = \sum_{n=1}^{\infty} n \left(1 - \frac{1 - p - q}{1 - q}\right)^n \frac{1 - p - q}{1 - q}

Recognizing this as a geometric series, the expected value is:

E[X]=1f0f0=1q1pq\mathbb{E}[X] = \frac{1 - f_0}{f_0} = \frac{1 - q}{1 - p - q}

(5)

The correlation coefficient ρXY\rho_{XY} is given by:

ρXY=Cov(X,Y)σXσY\rho_{XY} = \frac{\mathrm{Cov}(X, Y)}{\sigma_X \sigma_Y}

where Cov(X,Y)\mathrm{Cov}(X, Y) is the covariance of XX and YY, and σX,σY\sigma_X, \sigma_Y are the standard deviations of XX and YY.

1. Calculate E[X]\mathbb{E}[X] and E[Y]\mathbb{E}[Y]

As calculated earlier:

E[X]=p1pq,E[Y]=q1pq\mathbb{E}[X] = \frac{p}{1 - p - q}, \quad \mathbb{E}[Y] = \frac{q}{1 - p - q}

2. Calculate E[XY]\mathbb{E}[XY]

To find E[XY]\mathbb{E}[XY], we note that XX and YY count the number of steps taken in the horizontal and vertical directions, respectively. Since XX and YY are dependent (given that they are both influenced by the same random walk process), we calculate the expected value of their product as follows:

First, recognize that XX and YY are determined by the number of right steps and up steps, respectively, until the first time the particle stops moving. This stopping is determined by the geometric distribution of taking either a right or up step.

Given that the probability of moving right is pp, and moving up is qq, the expected value E[XY]\mathbb{E}[XY] considers both:

E[XY]=n=0k=0nk(nk)(nk)pkqnk(1pq)\mathbb{E}[XY] = \sum_{n=0}^{\infty} \sum_{k=0}^{n} k(n-k) \binom{n}{k} p^k q^{n-k} (1 - p - q)

To simplify, we first express XYXY as:

E[XY]=n=0k=0nk(nk)(nk)pkqnk(1pq)\mathbb{E}[XY] = \sum_{n=0}^{\infty} \sum_{k=0}^{n} k(n-k) \binom{n}{k} p^k q^{n-k} (1 - p - q)

Given the symmetry of pp and qq:

E[XY]=pqn=0n(n1)(p+q)n2(1pq)\mathbb{E}[XY] = pq \sum_{n=0}^{\infty} n(n-1) (p + q)^{n-2} (1 - p - q)

Recognizing that the series sum over nn is a known result of the second moment of a geometric distribution:

E[XY]=2pq(1pq)2\mathbb{E}[XY] = \frac{2pq}{(1 - p - q)^2}

3. Calculate the covariance Cov(X,Y)\mathrm{Cov}(X, Y)

The covariance is given by:

Cov(X,Y)=E[XY]E[X]E[Y]\mathrm{Cov}(X, Y) = \mathbb{E}[XY] - \mathbb{E}[X]\mathbb{E}[Y]

Substitute the earlier results:

Cov(X,Y)=2pq(1pq)2p1pqq1pq\mathrm{Cov}(X, Y) = \frac{2pq}{(1 - p - q)^2} - \frac{p}{1 - p - q} \cdot \frac{q}{1 - p - q}

This simplifies to:

Cov(X,Y)=pq(1pq)2\mathrm{Cov}(X, Y) = \frac{pq}{(1 - p - q)^2}

4. Calculate the variances σX2\sigma_X^2 and σY2\sigma_Y^2

The variance of XX (and similarly YY) is:

σX2=E[X2](E[X])2\sigma_X^2 = \mathbb{E}[X^2] - (\mathbb{E}[X])^2

For a geometric distribution:

E[X2]=p(1p)(1pq)2\mathbb{E}[X^2] = \frac{p(1 - p)}{(1 - p - q)^2}

Thus:

σX2=p(1p)(1pq)2,σY2=q(1q)(1pq)2\sigma_X^2 = \frac{p(1 - p)}{(1 - p - q)^2}, \quad \sigma_Y^2 = \frac{q(1 - q)}{(1 - p - q)^2}

5. Calculate the correlation coefficient ρXY\rho_{XY}

Finally, the correlation coefficient is:

ρXY=Cov(X,Y)σXσY=pq(1pq)2p(1p)(1pq)2q(1q)(1pq)2\rho_{XY} = \frac{\mathrm{Cov}(X, Y)}{\sigma_X \sigma_Y} = \frac{\frac{pq}{(1 - p - q)^2}}{\sqrt{\frac{p(1 - p)}{(1 - p - q)^2}} \sqrt{\frac{q(1 - q)}{(1 - p - q)^2}}}

This simplifies to:

ρXY=pq(1p)(1q)\rho_{XY} = \sqrt{\frac{pq}{(1 - p)(1 - q)}}

This is the correct expression for the correlation coefficient between XX and YY.

Knowledge

随机行走 期望 几何分布 协方差 二项式

解题技巧和信息

这类题型考察了随机过程中的停步问题及其相关的期望和概率计算。重点在于理解概率分布的特性,并运用几何分布、协方差等知识求解相关概率和期望。

重点词汇

  • Random walk 随机游动
  • Expectation 期望
  • Covariance 协方差
  • Geometric distribution 几何分布
  • Correlation coefficient 相关系数

参考资料

  1. Probability and Statistics by DeGroot and Schervish, Chapter 4 - Random Variables.
  2. Introduction to Probability by Bertsekas and Tsitsiklis, Chapter 7 - Random Walks and Markov Chains.