DeepAI AI Chat
Log In Sign Up

An Information-Theoretic Approach for Automatically Determining the Number of States when Aggregating Markov Chains

by   Isaac J. Sledge, et al.

A fundamental problem when aggregating Markov chains is the specification of the number of state groups. Too few state groups may fail to sufficiently capture the pertinent dynamics of the original, high-order Markov chain. Too many state groups may lead to a non-parsimonious, reduced-order Markov chain whose complexity rivals that of the original. In this paper, we show that an augmented value-of-information-based approach to aggregating Markov chains facilitates the determination of the number of state groups. The optimal state-group count coincides with the case where the complexity of the reduced-order chain is balanced against the mutual dependence between the original- and reduced-order chain dynamics.


Reduction of Markov Chains using a Value-of-Information-Based Approach

In this paper, we propose an approach to obtain reduced-order models of ...

Information-Theoretic Reduction of Markov Chains

We survey information-theoretic approaches to the reduction of Markov ch...

Enabling Quantum Speedup of Markov Chains using a Multi-level Approach

Quantum speedup for mixing a Markov chain can be achieved based on the c...

The Capacity of Count-Constrained ICI-Free Systems

A Markov chain approach is applied to determine the capacity of a genera...

Mode Reduction for Markov Jump Systems

Switched systems are capable of modeling processes with underlying dynam...