Computer aided solving the high-order transition probability matrix of the finite Markov chain (Q2369093)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computer aided solving the high-order transition probability matrix of the finite Markov chain |
scientific article; zbMATH DE number 5020491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computer aided solving the high-order transition probability matrix of the finite Markov chain |
scientific article; zbMATH DE number 5020491 |
Statements
Computer aided solving the high-order transition probability matrix of the finite Markov chain (English)
0 references
28 April 2006
0 references
A known explicit expression of the powers of a stochastic matrix \(P\) with all different eigenvalues is extended to the case without the nonequal restriction. An algorithm of mechanization programmed in Maple by using computer algebra is designed for computing \(P^n\). Examples with stochastic matrices possessing all different eigenvalues are shown.
0 references
Markov chain
0 references
transition probability matrix
0 references
algorithm
0 references
mechanization
0 references
numerical examples
0 references
stochastic matrix
0 references
0 references
0.798101007938385
0 references
0.7867778539657593
0 references
0.7780227065086365
0 references