Professional Documents
Culture Documents
Problem Sheet 5
1. Suppose we have two boxes labelled 1 and 2. We also have d balls
labelled 1, 2, , d. Initially some of these balls are in box1 and others
are in box 2. At each instant an integer between 1 and d is selected
at random and the ball labelled by that integer is removed from its
box and placed in the other. Let X0 be the initial number of balls in
box 1 and let Xn be the number of balls in box 1 after the exchange at
instant n. Show that Xn is a Markov chain and find its transition probability matrix. Show that the chain is recurrent and find its stationary
distribution. For the case, d = 3, find Px (T 0 = n), for n = 1, 2, 3.
2. Suppose that whether or not it rains today depends on the weather
conditions for the previous three days. Explain how we can set up a
Markov chain model for this. Suppose that if it rained on each of the
previous three days then it will rain today with probability 0.6; if it did
not rain on any of the previous three days then it will rain today with
probability 0.2; in all other cases the weather today would be same as
that yesterday with probability 0.5. Now find the transition probability
for the chain.
3. Consider a Markov chain on nonnegative integers having transition
probabilities, P (x, x + 1) = p and P (x, 0) = 1 p where 0 < p < 1.
Show that the chain is irreducible and recurrent. Find P0 (T0 = n).
Show that the chain has unique stationary distribution and find that
distribution.
4. A transition probability matrix is said to be doubly stochastic if each
of the columns sum to one. (Recall that in any transition probability
matrix, the rows sum to one). Suppose that a Markov chain with
M states is irreducible and that its transition probability matrix is
doubly stochastic. Show that its stationary distribution is given by
(y) = M1 , y.
5. On a road, three out of every four trucks are followed by a car while
only one out of every five cars is followed by a truck. Find the ratio of
trucks to cars on the road.