scientific article; zbMATH DE number 19236

MaRDI QIDQ3976669zbMATH OpenFDO

Authors Tao Yang, J. G. C. Templeton, M. J. M. Posner

Publication date 26 June 1992

zbMATH Keywords

examplesrecursive computation of Markov processes

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Probabilistic methods, stochastic differential equations (65C99)

Recommendations

• A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains
• scientific article; zbMATH DE number 549928
• Algorithms for determining the state-time probabilities and the limit matrix in Markov chains
• A recursive algorithm for computing the distribution of the number of successes in higher-order Markovian trials

Cited in

(5)

• Zero-Order Markov Processes with Multiple Final Sequences of States
• An approach for determining the matrix of limiting state probabilities in discrete Markov processes.
• On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net
• Recursive partial realization from the combined sequence of Markov parameters and moments
• A recursive algorithm for computing the distribution of the number of successes in higher-order Markovian trials

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976669)