create new finite-state Markov chain
MarkovChain(P, S, i, n)
Matrix; transition matrix
Vector; state space
posint; initial state
posint; number of states per year
The MarkovChain command creates a new finite state Markov chain.
The parameter P is the transition matrix; it must be a square matrix (see Matrix) of size d, where d is the number of states in the Markov chain. The value Pi,j defines the probability of moving from state j to state i.
The parameter S is a vector containing values for all possible states of the process.
The parameter n is the number of states per year. This process can only be simulated with m=n⁢k time steps per year, where k is a positive integer. Assume for example that X is a finite state Markov chain with 3 states per year. If we simulate the process X on the interval 0..2 with 12 time steps, then the state change can occur only at steps 2, 4, 6, 8, and 10.
188.8.131.52.184.108.40.206.2.2.…220.127.116.11.18.104.22.168.2.2.…22.214.171.124.126.96.36.199.2.1.…188.8.131.52.184.108.40.206.2.2.…220.127.116.11.18.104.22.168.2.2.…22.214.171.124.126.96.36.199.2.2.…188.8.131.52.184.108.40.206.2.1.…220.127.116.11.18.104.22.168.2.2.…22.214.171.124.126.96.36.199.2.2.…188.8.131.52.184.108.40.206.2.2.…10 × 11 Array
The following command will issue an error because the number of time steps used in simulation must be a multiple of the number of states per year.
Error, (in Finance:-SamplePath) update time .200000000000000011 does not belong to the time grid
The Finance[MarkovChain] command was introduced in Maple 15.
For more information on Maple 15 changes, see Updates in Maple 15.
Download Help Document
What kind of issue would you like to report? (Optional)