An aggregation/disaggregation algorithm for computing the stationary distribution of a large markov chain
From MaRDI portal
Publication:4021160
DOI10.1080/15326349208807239zbMATH Open0756.60058OpenAlexW2070219174MaRDI QIDQ4021160FDOQ4021160
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
stochastic matricescomputational improvementdegree of couplingerror of the approximationstationary distribution of a large Markov chain
Cited In (15)
- 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
- 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
- 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
- Asymptotic Expansions for Stationary Distributions of Perturbed Semi-Markov Processes
- 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
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)