Calculation of higher transitions in a Markov process

DOI10.1287/OPRE.6.5.693MaRDI QIDQ5378819zbMATH OpenOpenAlexFDO

Authors William Miehle

Publication date 3 June 2019

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.6.5.693

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22)

Recommendations

• Graphes et algorithme de calcul de probabilités stationnaires d'un processus markovien discret. (Graphs and algorithm for the computation of stationary probabilities of a discrete Markov process)
• Computer aided solving the high-order transition probability matrix of the finite Markov chain
• A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains
• Algorithms for determining the state-time probabilities and the limit matrix in Markov chains
• An Introduction to Markov Processes

This page was built for publication: Calculation of higher transitions in a Markov process

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