DeepAI AI Chat
Log In Sign Up

Max Markov Chain

by   Yu Zhang, et al.

In this paper, we introduce Max Markov Chain (MMC), a novel representation for a useful subset of High-order Markov Chains (HMCs) with sparse correlations among the states. MMC is parsimony while retaining the expressiveness of HMCs. Even though parameter optimization is generally intractable as with HMC approximate models, it has an analytical solution, better sample efficiency, and the desired spatial and computational advantages over HMCs and approximate HMCs. Simultaneously, efficient approximate solutions exist for this type of chains as we show empirically, which allow MMCs to scale to large domains where HMCs and approximate HMCs would struggle to perform. We compare MMC with HMC, first-order Markov chain, and an approximate HMC model in synthetic domains with various data types to demonstrate that MMC is a valuable alternative for modeling stochastic processes and has many potential applications.


page 1

page 2

page 3

page 4


Markov Chain Models of Refugee Migration Data

The application of Markov chains to modelling refugee crises is explored...

Pairwise Choice Markov Chains

As datasets capturing human choices grow in richness and scale---particu...

Statistically efficient thinning of a Markov chain sampler

It is common to subsample Markov chain output to reduce the storage burd...

Quantifying the accuracy of approximate diffusions and Markov chains

Markov chains and diffusion processes are indispensable tools in machine...

An approximation algorithm for random generation of capacities

Capacities on a finite set are sets functions vanishing on the empty set...

Markov Chain-Based Stochastic Strategies for Robotic Surveillance

This article surveys recent advancements of strategy designs for persist...