Aggregation of Markov processes: Axiomatization
From MaRDI portal
An aggregator is a map from (column) stochastic \(n\times n\) matrices to (column) stochastic \(m\times m\) matrices. The authors characterise aggregators satisfying two axioms. This is useful in applications of finite state Markov chains where one need to decrease the number of states.
Recommendations
Cites work
Cited in
(10)- Aggregation of Markov chains
- On fast aggregation of Markov chain functionals using stochastic complementation.
- Network cohesion
- Aggregated Markov processes with negative exponential time interval omission
- A unified view of aggregation and coherency in networks and Markov chains†
- scientific article; zbMATH DE number 3920166 (Why is no real title available?)
- scientific article; zbMATH DE number 4028553 (Why is no real title available?)
- A canonical representation for aggregated Markov processes
- Aggregation of Markov flows I: theory
- Aggregation of systems described by Markov chains
This page was built for publication: Aggregation of Markov processes: Axiomatization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118907)