Consider the transition matrix:
$\begin{bmatrix} \frac{1}{5} & \frac{4}{5} & 0 & 0 & 0 \\
\frac{1}{2} & \frac{1}{2} & 0 & 0 & 0 \\ \frac{1}{5} & \frac{1}{5} & \frac{1}{5} & \frac{1}{5} & \frac{1}{5} \\ 0 & \frac{1}{3} & \frac{1}{3} & \frac{1}{3} & 0 \\ 0 & 0 & 0 & 0 & 1 \end{bmatrix}$
What is the expected long run proportion of time the chain spends at $a$, given that it starts at $b$.
I know that I must use the stationary distributions of each $\pi(j)$ in question. Since $a$ and $b$ only communicate with each other, I get the system of simulataneous equations:
$\pi(a) = \frac{1}{2} \cdot \pi(b) + \frac{1}{5} \cdot \pi(a)$
$\pi(b) = \frac{4}{5} \cdot \pi(a) + \frac{1}{2} \cdot \pi(b)$
with these I am getting a distribution $\pi = (\frac{5}{13}, \frac{8}{13})$, Is this correct?
if the distribution started at $c$, as in the title of the post, would my equations now be 3 simulatenous equations which look like:
$\pi(a) = \frac{1}{5} \cdot \pi(a) + \frac{1}{2} \cdot \pi(b) + \frac{1}{5} \cdot \pi(c)$
$\pi(a) = \frac{4}{5} \cdot \pi(a) + \frac{1}{2} \cdot \pi(b) + \frac{1}{5} \cdot \pi(c)$
$\pi(c) = \frac{1}{5} \cdot \pi(c)$
I am uncertain about the last equation. What I am confused about is $c$ leads to every state, but if I include all of them then I will have a system of 6 equations. Since the question is asking specifically about $a$ which can only be reached by states $a,b,c$, shouldn't we only be considering the equations I wrote?