Solution to Assignment 5
1 (p.107). D =
. The eigenvalue of D are 0 and ( + ) with its cor1
1
responding eigenvector are
and
respectively. Write Q =
1
1
.
It is easy to see that
Q1 DQ =
0
0
0 ( +
Solution to Quiz 2
1. (a) Since all the ospring distributions have the same distributions ,
we have
E1 (Xn |Xn1 = k ) = E (k ) = kE ( ) = k.
(b) Let us prove Ex (Xn ) = n x. When n = 0, obviously. Sup
Solution to Mid-term Examination
1. (a) The Markov matrix P is an (N + 1) (N + 1) matrix as follows:
01
0
0
1 0 N 1 0
N
N
.
. .
.
. . . .
.
.
.
. ,
.
N i
i
.
0
.
.N
N
. .
.
. . . .
.
.
.
1
0 N
Solution to Quiz 3
1. (a)
P (X (t) = n|X (r) = m)
P (X (t) = n, X (r) = m)
=
P (X (r) = m)
P (X (t) X (r) = n m, X (r) = m)
=
P (X (r) = m)
=P (X (t) X (r) = n m)
=P (X (t r) = n m)
=
(t r)nm e(tr)
.
Solution to Quiz 1
1. (a) Let the airport A be state 0, hotel B be state 1 and hotel C be
state 2. By what is stated in question, P (0, 0) = 0, P (0, 1) =
4
1
4
P (0, 2) = 1 ; P (1, 0) = 5 , P (1, 1)
Solution to Assignment 4
22a (p.83). Denote i j if P (i, j ) > 0, where P is the transition probability. Note
that in this matrix
0 2 1 0,
the chain is irreducible.
(b) Note that
0
P2 = 0 0 1 ; P3 =
Solution to Assignment 2
20a (p.44). By a rearrangement of states, we have the following
0
1
2
4
3
5
012435
1
1
0000
2
2
1
2
0000
3
3
1
008700
8
3
004100
4
1
1
0101
4
4
4
4
1
010152
5
5
5
We see that
Solution to Assignment 1
2 (p.41). Note that the state space is cfw_0, 1, , d. Denote Xn the number of black
balls in box 1. Recall that we want to nd
P (x, y ) = P(Xn+1 = y |Xn = x).
If x = 0, then y
Remark on tutorial 4
Im sorry that I made a mistake in Exercise 3 in the tutorial, some students point out
that we should tackle the boundary term more carefully. It is right. The following is a
compl