« View all new features in Mathematica 9  previous  |  next 
New in Mathematica 9Markov Chains and Queues

Structural Properties of Finite Markov Processes 

Find the communicating classes, highlighted in the graph through different colors.

In[1]:=
Click for copyable input
X
In[2]:=
Click for copyable input
X
Out[2]=
In[3]:=
Click for copyable input
X
Out[3]=

Check for irreducibility, which means there is only one communicating class.

In[4]:=
Click for copyable input
X
Out[4]=

Find the recurrent classes, which are classes that cannot be exited.

In[5]:=
Click for copyable input
X
Out[5]=

Find the transient classes, which are classes that can be exited.

In[6]:=
Click for copyable input
X
Out[6]=

Find the absorbing classes, which are recurrent classes with a single state.

In[7]:=
Click for copyable input
X
Out[7]=