Computing hitting probabilities of Markov chains: structural results with regard to the solution space of the corresponding system of equations
From MaRDI portal
Publication:2176038
Recommendations
- scientific article; zbMATH DE number 729460
- Stable computation with the fundamental matrix of a Markov chain
- Algorithms for finding steady state probabilities for some special classes of finite state Markov chains
- Numerical Methods in Markov Chain Modeling
- Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
Cites work
- scientific article; zbMATH DE number 3736679 (Why is no real title available?)
- scientific article; zbMATH DE number 3260110 (Why is no real title available?)
- A generalized Jacobi-Perron algorithm for the reduction of systems of linear difference equations
- A note on the numerical solution of linear recurrence relations
- Characterizations of dominant and dominated solutions of linear recursions
- Computational Aspects of Three-Term Recurrence Relations
- Linear difference equations and generalized continued fractions
- Markov chains and generalized continued fractions
- Markov chains and stochastic stability
- Matrix continued fractions related to first-order linear recurrence systems
- Pringsheim's theorem for generalized continued fractions
- Zur Numerik rekurrenter Relationen
- Über die Minimallösung der Poincaré-Perronschen Differenzengleichung. (On the minimal solution of Poincaré-Perron type difference equations)
This page was built for publication: Computing hitting probabilities of Markov chains: structural results with regard to the solution space of the corresponding system of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176038)