arXiv Analytics

Sign in

arXiv:1909.11217 [math.PR]AbstractReferencesReviewsResources

On Transformations of Markov Chains and Poisson Boundary

Iddo Ben-Ari, Behrang Forghani

Published 2019-09-24Version 1

A discrete-time Markov chain can be transformed into a new Markov chain by looking at its states along iterations of an almost surely finite stopping time. By the optional stopping theorem, any bounded harmonic function with respect to the transition function of the original chain is harmonic with respect to the transition function of the transformed chain. The reverse inclusion is in general not true. Our main result provides a sufficient condition on the stopping time which guarantees that the space of bounded harmonic functions for the transformed chain embeds in the space of bounded harmonic sequences for the original chain. We also obtain a similar result on positive unbounded harmonic functions, under some additional conditions. Our work was motivated by and is analogous to Forghani-Kaimanovich, the well-studied case when the Markov chain is a random walk on a discrete group.

Related articles: Most relevant | Search more
arXiv:1209.4314 [math.PR] (Published 2012-09-19)
Transformations of random walks on groups via Markov stopping times
arXiv:1301.1506 [math.PR] (Published 2013-01-08, updated 2014-01-23)
The Boundary of a Square Tiling of a Graph coincides with the Poisson Boundary
arXiv:0911.0616 [math.PR] (Published 2009-11-03, updated 2011-01-07)
Poisson boundary of groups acting on real trees