Computing absorption probabilities for a Markov chain
From MaRDI portal
Recommendations
Cites work
- Further Comparisons of Direct Methods for Computing Stationary Distributions of Markov Chains
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 3942890 (Why is no real title available?)
- scientific article; zbMATH DE number 3325280 (Why is no real title available?)
- Numerical computation of mean passage times and absorption probabilities in Markov and Semi-Markov models
- Reduced System Algorithms for Markov Chains
- Reduced systems in Markov chains and their applications in queueing theory
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
Cited in
(10)- On the absorption probabilities and mean time for absorption for discrete Markov chains
- An absorbing Markov chain in labour system planning
- State reduction in a Markov decision process
- Reduction of absorbing Markov chain
- scientific article; zbMATH DE number 1051728 (Why is no real title available?)
- A partitioning algorithm for solving systems of linear equations
- Computing mean first passage times for a Markov chain
- Computing the fundamental matrix for a nonirreducible Markov chain
- Mapping absorption processes onto a Markov chain, conserving the mean first passage time
- Imprecise Markov chains with absorption
This page was built for publication: Computing absorption probabilities for a Markov chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009322)