Content deleted Content added
Link suggestions feature: 3 links added. |
m Maximal set is a (now redirect) page about an unrelated concept in computability theory |
||
Line 69:
:<math> \Pr(X_{n_{ij}}=j \mid X_0=i) = p_{ij}^{(n_{ij})} > 0.</math>
A state ''i'' is said to communicate with state ''j'' (written ''i'' ↔ ''j'') if both ''i'' → ''j'' and ''j'' → ''i''. A communicating class is a
A communicating class is closed if the probability of leaving the class is zero, namely if ''i'' is in ''C'' but ''j'' is not, then ''j'' is not accessible from ''i''.<ref name="PRS"/> The set of communicating classes forms a [[directed acyclic graph|directed, acyclic graph]] by inheriting the arrows from the original state space. A communicating class is closed if and only if it has no outgoing arrows in this graph.
| |||