Two states lie in the same communicating class when each is reachable from the other by transitions of positive probability. Inspecting the directed transitions gives three classes:
State 1 has no incoming transition from another state and can leave, so its singleton class is open and transient. More explicitly, the probability of returning to 1 after time zero is only , since a departure can never be reversed.
States communicate: and are positive-probability paths. The class is open because, for example, and leave it; no transition from the class returns to it. Every state of is transient. One can see eventual exit directly: from each of its four states there is a positive-probability path of at most three steps to 8; the minimum of these four path probabilities is positive, so survival through repeated three-step blocks has a geometrically decreasing upper bound.
Finally shows that communicates, and every outgoing transition stays inside it. It is a closed finite irreducible class, so all its states are positive recurrent. Therefore the first two classes are open and transient; the last is closed and recurrent.

Articles by others on the same topic (0)

There are currently no matching articles.