I have very recently started learning about Markov chains. I know what the Stochastic matrix is. However, I came across a question like:
If a transition probability matrix is of order $n\times n$ then number of steady state equations would be:
- $n$
- $n^2$
- $n-1$
- $n+1$
I'm not sure what they mean by "steady state equations". Haven't come across that term while learning Markov chains. Could someone please explain or provide some reference?