Block Markov chains on trees

From MaRDI portal
Publication:2106442

DOI10.1007/978-3-031-06170-7_8zbMATH Open1504.60121arXiv2008.09978OpenAlexW3080451133MaRDI QIDQ2106442FDOQ2106442


Authors: A. Souissi Edit this on Wikidata


Publication date: 14 December 2022

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.


Full work available at URL: https://arxiv.org/abs/2008.09978




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Block Markov chains on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106442)