Question 11.5.15: Show that any ergodic Markov chain with a symmetric transiti......

Show that any ergodic Markov chain with a symmetric transition matrix (i.e., pij = pji) is reversible.

The blue check mark means that this solution has been answered and checked by an expert. This guarantees that the final answer is accurate.
Learn more on how we answer questions.

If pij = pji then P has column sums 1. We have seen (Exercise 9 of Section 11.3) that in this case the fixed vector is a constant vector. Thus for any two states si and sj , wi = wj and pij = pji.Thus wipij = wj pji, and the chain is reversible.

Related Answered Questions

Question: 11.2.33

Verified Answer:

In each case Exercise 27 shows that f(i) = biNf(N)...
Question: 11.2.31

Verified Answer:

You can easily check that the proportion of G’s in...
Question: 11.2.27

Verified Answer:

Use the solution to Exercise 24 with w = f.
Question: 11.5.23

Verified Answer:

Assume that the chain is started in state si. Let ...
Question: 11.5.21

Verified Answer:

The transition matrix is P= \begin{matrix} ...
Question: 11.5.19

Verified Answer:

Recall that m_{ij}= \sum\limits_{j}{\frac{z...
Question: 11.5.18

Verified Answer:

Form a Markov chain whose states are the possible ...
Question: 11.5.17

Verified Answer:

We know that wZ = w. We also know that mki = (zii ...
Question: 11.5.13

Verified Answer:

Assume that w is a fixed vector for P. Then ...