Compressing redundant information in Markov chains
Giacomo Aletti
Abstract
Given a strongly stationary Markov chain and a finite set of stopping rules, we prove the existence of a polynomial algorithm which projects the Markov chain onto a minimal Markov chain without redundant information. Markov complexity is hence defined and tested on some classical problems.
Create a lesson
Related papers
Mean convergence for Banach space-valued random elements indexed in measure spaces
Nguyen Thi Kim Sang, Nguyen Tran Thuan
Extinction and extinguishment properties for a nonlinear predator-prey branching model
Lina Ji, Jie Xiong, Wen Xu et al.
Multihomogeneous Measures and Stochastic Polar Representations
Enkelejd Hashorva
Cramér transform, half-space depth and threshold phenomena for convex bodies
Minas Pafis
Equilibrium fluctuations of the weakly asymmetric inclusion process
Simon Gabriel
Counterexamples to the site-percolation analogues of the Easo-Severo-Tassion cutset theorems
Joel Bassil