An aggregation/disaggregation algorithm for computing the stationary distribution of a large markov chain

DOI10.1080/15326349208807239zbMATH Open0756.60058OpenAlexW2070219174MaRDI QIDQ4021160FDOQ4021160

Authors: Moshe Haviv 

Publication date: 17 January 1993

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349208807239

Recommendations

• Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
• Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
• scientific article; zbMATH DE number 1848276
• Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain
• scientific article; zbMATH DE number 830005

zbMATH Keywords

stochastic matricescomputational improvementdegree of couplingerror of the approximationstationary distribution of a large Markov chain

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cited In (18)

• Iterative Methods for Computing Stationary Distributions of Nearly Completely Decomposable Markov Chains
• Title not available (Why is that?)
• Aggregation algorithms for perturbed Markov chains with applications to networks modeling
• Iterative aggregation/disaggregation techniques for nearly uncoupled markov chains
• Parallel implementation of an aggregation/disaggregation method for evaluating quasi-stationary behavior in continuous-time Markov chains
• An algorithm approach to bounding aggregations of multidimensional Markov chains
• Asymptotic expansions for stationary distributions of perturbed semi-Markov processes
• Aggregation/Disaggregation Methods for Computing the Stationary Distribution of a Markov Chain
• Title not available (Why is that?)
• Updating Markov Chains with an Eye on Google's PageRank
• An iterative aggregation/disaggregation procedure for modelling the long-term behaviour of continuous-time evanescent random processes
• Red light green light method for solving large Markov chains
• A Method to Calculate Steady-State Distributions of Large Markov Chains by Aggregating States
• Comparisons Between Aggregation/Disaggregation and a Direct Algorithm for Computing the Stationary Probabilities of a Markov Chain
• Fast computation of stationary joint probability distribution of sparse Markov chains
• Iterative aggregation/disaggregation methods for computing some characteristics of Markov chains. II: Fast convergence
• Technical Note—A Markov Chain Partitioning Algorithm for Computing Steady State Probabilities
• A combinatorial approach to nearly uncoupled Markov chains. I: Reversible Markov chains

This page was built for publication: An aggregation/disaggregation algorithm for computing the stationary distribution of a large markov chain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4021160)