Simplicial algorithms for computing stationary probabilities of stochastic matrices
From MaRDI portal
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)
- A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
- The computation of stationary distributions of Markov chains through perturbations
- Algorithms for finding steady state probabilities for some special classes of finite state Markov chains
- scientific article; zbMATH DE number 989251
Cites work
- scientific article; zbMATH DE number 3174818 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 850127 (Why is no real title available?)
- scientific article; zbMATH DE number 3219506 (Why is no real title available?)
- Bounded flatness in Q-triangulated regular n-simplexes
- Extensions of Lemke's algorithm for the linear complementarity problem
- Simplicial algorithms on the simplotope
- Simplizialzerlegungen von beschränkter Flachheit
- The Game of Hex and the Brouwer Fixed-Point Theorem
- Triangulations and simplicial methods
This page was built for publication: Simplicial algorithms for computing stationary probabilities of stochastic matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294413)