The computation of stationary distributions of Markov chains through perturbations

Review text

Summary: An algorithmic procedure for the determination of the stationary distribution of a finite, m-state, irreducible Markov chain, that does not require the use of methods for solving systems of linear equations, is presented. The technique is based upon a succession of m, rank one, perturbations of the trivial doubly stochastic matrix whose known steady state vector is updated at each stage to yield the required stationary probability vector.

Recommendations

Cited in

(37)

Numerical calculation of the stationary distribution of a Markov chain in genetics
Probabilistic approach to computational algorithms for finding stationary distributions of Markov chains
Simplicial algorithms for computing stationary probabilities of stochastic matrices
Entrywise perturbation theory and error analysis for Markov chains
A direct projection method for Markov chains
The computation of the mean first passage times for Markov chains
A numerical algorithm on the computation of the stationary distribution of a discrete time homogenous finite Markov chain
The ODE method for stability of skip-free Markov chains with applications to MCMC
Stationary distributions and mean first passage times of perturbed Markov chains
On an algorithm for calculating stationary probabilities of the Markov chains
Some Improvements for the Computation of the Steady-State Distribution of a Markov Chain by Monotone Sequences of Vectors
Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
A partitioning algorithm for computing limiting distributions of ill-conditioned Markov chains
scientific article; zbMATH DE number 989251 (Why is no real title available?)
scientific article; zbMATH DE number 6831530 (Why is no real title available?)
Computing the stationary distribution of a finite Markov chain through stochastic factorization
The computation of key properties of Markov chains via perturbations
Iterative Bounds on the Equilibrium Distribution of a Finite Markov Chain
Computational discrete time Markov chain with correlated transition probabilities
Using the QR Factorization and Group Inversion to Compute, Differentiate, and Estimate the Sensitivity of Stationary Probabilities for Markov Chains
An Approximation to the Stationary Distribution of a Nearly Completely Decomposable Markov Chain and Its Error Analysis
A Stable Algorithm to Calculate Steady-State Probability & Frequency of a Markov System
scientific article; zbMATH DE number 4072333 (Why is no real title available?)
scientific article; zbMATH DE number 19233 (Why is no real title available?)
scientific article; zbMATH DE number 19251 (Why is no real title available?)
Comparacion numerica de algoritmos para calcular distribuciones estacionarias de cadenas de Markov finitas
The researches of the stationary distribution for Markov chain based on conductive transformation
scientific article; zbMATH DE number 4119358 (Why is no real title available?)
scientific article; zbMATH DE number 1424145 (Why is no real title available?)
Computing approximate stationary distributions for discrete Markov processes with banded infinitesimal generators
Censoring technique and numerical computations of invariant distribution for continuous-time Markov chains
scientific article; zbMATH DE number 7266446 (Why is no real title available?)
On the stability of the computation of the stationary probabilities of Markov chains using Perron complements
Computing Densities for Markov Chains via Simulation
Comparison of perturbation bounds for the stationary distribution of a Markov chain
The impact of Prof. C. R. Rao's research used in solving problems in applied probability
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)