Exact and ordinary lumpability in finite Markov chains

1994/03/01 by Peter Buchholz · 10 citations
Mathematics · Computer Science · #Markov Chains and Monte Carlo Methods #Petri Nets in System Modeling #Data Management and Algorithms

paper · doi:10.2307/3215235

Abstract

Exact and ordinary lumpability in finite Markov chains is considered. Both concepts naturally define an aggregation of the Markov chain yielding an aggregated chain that allows the exact determination of several stationary and transient results for the original chain. We show which quantities can be determined without an error from the aggregated process and describe methods to calculate bounds on the remaining results. Furthermore, the concept of lumpability is extended to near lumpability yielding approximative aggregation.

Cited by

• On totally synchronizing graphs
• Wasserstein error bounds for aggregations of continuous-time Markov chains
• Learning Markov models via low-rank optimization
• Exploiting Equitable Partitions for Efficient Block Triangularization
• Mean-Field Approximation of Dynamics on Networks
• The Arnoldi Aggregation for Approximate Transient Distributions of Markov Chains
• Efficient Solving of Large Single Input Superstate Decomposable Markovian Decision Process
• Open Systems: A Double Categorical Perspective
• Survival Dynamical Systems for the Population-level Analysis of\n Epidemics
• Spectral State Compression of Markov Processes

Related

• Finding the Smallest Possible Exact Aggregation of a Markov Chain
• On aggregated Markov processes
• A dual eigenvector condition for strong lumpability of Markov chains
• Markov chain aggregation and its application to rule-based modelling
• Computing Inferences for Large-Scale Continuous-Time Markov Chains by Combining Lumping with Imprecision