4 Markov chains

4.6 Calculating the asymptotic distribution

Lemma 4.6.1.

If P has an asymptotic distribution π, then π is also its unique invariant distribution.

Proof.

First, let t in πt+1=πtP which gives π=πP, so that π is also invariant. Secondly, suppose that π* is invariant, set π1=π*, so that πt=π* for all t; but we know that πtπ. Thus π* must be the asymptotic distribution, π. ∎

Remark.

This shows that, if it exists, the asymptotic distribution is the unique invariant distribution. The following theorem shows when a Markov chain has an asymptotic distribution.

Theorem 4.6.2.

A Markov chain, with a finite number of states, has an asymptotic distribution if and only if it is aperiodic and all persistent states are in the same communicating class.

Remark.

So all irreducible aperiodic Markov chains (with a finite number of states) have an asymptotic distribution.

Example 4.6.3.

In the following two examples with finite number of states, the conditions for the existence of the asymptotic distributions are not satisfied. Firstly,

P1=(001212001212121200121200),P12=(121200121200001212001212).

Successive powers of P1 alternate between these two forms with P1t=P1 if t is odd and P1t=P12 if t is even. Therefore, P1t does not have a limit and so neither does πt=π0P1t for arbitrary π0. Using a MC diagram, it is easy to see that this Markov chain is irreducible and periodic (with period 2).

The second example is:

P2=(121200121200001212001212)

In this case, it is easy to check that P2t=P2 for all t and hence limtP2t exists. However, in the limit matrix not all rows are equal and hence the limiting distribution depends on the initial distribution and consequently, the asymptotic distribution does not exist. Easy to check that this chain is reducible, as it is impossible to go from states {1,2} to {3,4}, and vice-versa. In this case P(Xt=1|X0=1)=1/2 and P(Xt=1|X0=3)=0 for all t.

Exercise 4.6.4.

For the following two Markov chains, find the transition matrix, compute the invariant distribution, and say whether the invariant distribution is the asymptotic distribution.

Consider a Markov chain defined by the position of an object on corners of (i) a square and (ii) a triangle. At each time point you toss a fair coin and move the object to the neighbouring corner anticlockwise (if the coin lands head up) or clockwise (otherwise).

(i)

P=(012012120120012012120120)

The invariant distribution is π=(1/4,1/4,1/4,1/4) but is not the asymptotic distribution since the MC is periodic with period 2.

(ii)

P=(012121201212120)

The invariant distribution is π=(1/3,1/3,1/3) and is the asymptotic distribution since the MC is aperiodic and irreducible.