Block Markov Chains on Trees
Probability
2020-08-25 v1
Abstract
We introduce block Markov chains (BMCs) indexed by an infinite rooted tree. It turns out that BMCs define a new class of tree-indexed Markovian processes. We clarify the structure of BMCs in connection with Markov chains (MCs) and Markov random fields (MRFs). Mainly, show that probability measures which are BMCs for every root are indeed Markov chains (MCs) and yet they form a strict subclass of Markov random fields (MRFs) on the considered tree. Conversely, a class of MCs which are BMCs is characterized. Furthermore, we establish that in the one-dimensional case the class of BMCs coincides with MCs. However, a slight perturbation of the one-dimensional lattice leads to us to an example of BMCs which are not MCs appear.
Keywords
Cite
@article{arxiv.2008.09978,
title = {Block Markov Chains on Trees},
author = {Abdessatar Souissi},
journal= {arXiv preprint arXiv:2008.09978},
year = {2020}
}