A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains
DOI10.1080/02331934.2011.627333zbMATH Open1237.60061OpenAlexW2086291584MaRDI QIDQ3111140FDOQ3111140
Authors: Stefan Pickl, Dmitrii Lozovanu
Publication date: 18 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.627333
Recommendations
- Algorithms for determining the state-time probabilities and the limit matrix in Markov chains
- An approach for determining the matrix of limiting state probabilities in discrete Markov processes.
- scientific article; zbMATH DE number 7329538
- Algorithms for determining the transient and differential matrices in finite Markov processes
- 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)
polynomial time algorithmdiscrete Markov processlimit state matrixprobability of state transitiondynamic prgramming
Computational methods in Markov chains (60J22) Numerical analysis or methods applied to Markov chains (65C40) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Dynamic programming (90C39)
Cites Work
Cited In (11)
- Computational discrete time Markov chain with correlated transition probabilities
- Title not available (Why is that?)
- Algorithms for Markov stochastic models
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approach for determining the matrix of limiting state probabilities in discrete Markov processes.
- Algorithms for determining the state-time probabilities and the limit matrix in Markov chains
- An effective Markov based approach for calculating the limit matrix in the analytic network process
- About limit matrices of finite-state Markov chains
- Algorithms for determining the transient and differential matrices in finite Markov processes
- Computer aided solving the high-order transition probability matrix of the finite Markov chain
This page was built for publication: A dynamic programming approach for finite Markov processes and algorithms for the calculation of the limit matrix in Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3111140)