For positive rates the three states communicate, so the finite continuous-time Markov chain has a unique stationary probability vector. The first and third components of give
These two edge-balance relations and normalization yield, with ,
Their sum is one and each is nonnegative. The middle balance equation then follows from the other two, as expected from probability conservation. A line graph has no cycle that could carry a nonzero stationary circulation: each edge's forward and backward stationary traffic balances even if the bare rates differ. If some rates vanish, the process need not be an irreducible Markov chain and its stationary distribution need not be unique. The displayed expression remains valid when its denominator is nonzero and its limits select the communicating class reached, but it must not be used as a unique late-time law when disconnected closed classes retain dependence on the initial state.

Articles by others on the same topic (0)

There are currently no matching articles.