Consider a particle moving on the coordinate plane, and denote the location of the particle at time t∈{0,1,2,…} by (Xt,Yt). The initial location of the particle is (X0,Y0)=(0,0). Also, if (Xt,Yt)=(a,b), then (Xt+1,Yt+1)=(a+1,b) with probability p, (Xt+1,Yt+1)=(a,b+1) with probability q, and (Xt+1,Yt+1)=(a,b) with probability 1−p−q. Here, it is assumed that p,q>0, p+q<1, and the movements of the particle at different time points are independent. Let (X,Y) denote the location of the particle such that (Xt+1,Yt+1)=(Xt,Yt) for the first time. Answer the following questions.
(1) Show that the probability that (X,Y)=(1,2) is 3pq2(1−p−q).
(2) For non-negative integers n, find the probability that X+Y=n.
(3) For non-negative integers n, let fn denote the probability that X=n.
(a) Find f0.
(b) Express the probability that X≥n+1 given the condition X≥n, using f0.
(c) Show that fn=(1−f0)nf0.
(4) Express the expectation of X using p and q.
(5) Express the correlation coefficient between X and Y
E[(X−μX)2]E[(Y−μY)2]E[(X−μX)(Y−μY)]
using p and q, where μX=E[X] denotes the expectation of X and μY=E[Y] denotes the expectation of Y.
To calculate the probability that (X,Y)=(1,2), we consider the steps the particle must take to reach the position (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 p, moving up is q, and staying in the same place is 1−p−q, the possible sequences of moves that result in the particle reaching (1,2) can be:
Move right, then move up twice.
Move up, move right, then move up again.
Move up twice, then move right.
The probability for each of these sequences is p⋅q⋅q⋅(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:
To find the probability that X+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 n can be distributed between X (right steps) and Y (up steps). If X=k, then Y=n−k, and the probability of taking k steps to the right and n−k steps up is:
P(X=k,Y=n−k)=(kn)pkqn−k(1−p−q)
Summing over all possible values of k:
P(X+Y=n)=(1−p−q)k=0∑n(kn)pkqn−k
By the binomial theorem, ∑k=0n(kn)pkqn−k=(p+q)n, so:
To find f0, we need to calculate the probability that the particle never moves to the right, i.e., X=0. This occurs if the particle only moves up or stays in place until it reaches a position where it never moves again. Therefore, f0 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=0∑∞qk(1−p−q)=1−q1−p−q
(b) Express the probability that X≥n+1 given the condition X≥n, using f0
The probability that X≥n+1 given that X≥n is the probability that the particle does not stop after n steps, given that it hasn't stopped at n steps:
To find E[XY], we note that X and Y count the number of steps taken in the horizontal and vertical directions, respectively. Since X and Y 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 X and Y 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 p, and moving up is q, the expected value E[XY] considers both:
E[XY]=n=0∑∞k=0∑nk(n−k)(kn)pkqn−k(1−p−q)
To simplify, we first express XY as:
E[XY]=n=0∑∞k=0∑nk(n−k)(kn)pkqn−k(1−p−q)
Given the symmetry of p and q:
E[XY]=pqn=0∑∞n(n−1)(p+q)n−2(1−p−q)
Recognizing that the series sum over n is a known result of the second moment of a geometric distribution: