Quasi Lumpability, Lower-Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains

DOI10.1137/S0895479895294277zbMath0876.60054OpenAlexW2058837004MaRDI QIDQ4337394

Tuǧrul Dayar, William J. Stewart

Publication date: 19 May 1997

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895479895294277

zbMATH Keywords

Markov chainsdecomposabilitystationary probabilityaggregation-disaggregation schemesquasi lumpability

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Iterative numerical methods for linear systems (65F10) Continuous-time Markov processes on discrete state spaces (60J27) Direct numerical methods for linear systems and matrix inversion (65F05) Probabilistic methods, stochastic differential equations (65C99)

Related Items

An embedded Markov chain approach to stock rationing ⋮ Bounding the equilibrium distribution of Markov population models ⋮ Utilizing network structure to accelerate Markov chain Monte Carlo algorithms ⋮ Markov property for a function of a Markov chain: A linear algebra approach ⋮ An embedded Markov chain approach to stock rationing under batch orders ⋮ Analysis of Markov jump processes under terminal constraints ⋮ Stochastic Modelling of Communication Protocols from Source Code ⋮ A probabilistic algorithm for aggregating vastly undersampled large Markov chains

This page was built for publication: Quasi Lumpability, Lower-Bounding Coupling Matrices, and Nearly Completely Decomposable Markov Chains