Question 10.5.2: Consider an unbiased random walk on {1, 2, 3, 4, 5} with ref...

Consider an unbiased random walk on {1, 2, 3, 4, 5} with reflecting boundaries. Find the expected number of steps t_{j 4} required to get to state 4 starting at any state j ≠ 4 of the chain.

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.

The transition matrix for this Markov chain is

P=\left[\begin{array}{ccccc}0 & 1 / 2 & 0 & 0 & 0 \\1 & 0 & 1 / 2 & 0 & 0 \\0 & 1 / 2 & 0 & 1 / 2 & 0 \\0 & 0 & 1 / 2 & 0 & 1 \\0 & 0 & 0 & 1 / 2 & 0\end{array}\right].

First reorder the states to list state 4 first, then convert state 4 to an absorbing state.

\text { The matrix } Q \text { and the fundamental matrix } M=(I-Q)^{-1} \text { are }

\text { Summing the columns of } M \text { gives } t_{14}=9, t_{24}=8, t_{34}=5 \text {, and } t_{54}=1 .

Related Answered Questions

Question: 10.6.P.1

Verified Answer:

For entry (3,6) of A, the probability of a transit...
Question: 10.6.P.2

Verified Answer:

For entry (6, 3) of A, the probability of a transi...