Lower and Upper Bounds for the Survival of Infinite Absorbing Markov Chains

Sanjiban Choudhury
Tech. Report, CMU-RI-TR-15-04, Robotics Institute, Carnegie Mellon University, February, 2015

View Publication

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.


A wide variety of problems in the domain of directed percolation theory, con- tact process, voter models rely on the analysis of a infinite absorbing Markov chain. Although results for these problems have been obtained through other approaches, reasoning about the Markov chain gives rise to elegant results that are often explicit functions of the chain parameters. This allows results to be re- used across a wide variety of problems. In this paper, we present results for the survival of a class of discrete time Markov processes whose states are finite sets of integers. We present lower bounds using two different approaches as well as an upper bound. We borrow varied techniques and show in detail how they can be used to analyse Markov chains of this nature. The results presented in this paper can be used to derive many results in percolation theory in a completely independent manner.

author = {Sanjiban Choudhury},
title = {Lower and Upper Bounds for the Survival of Infinite Absorbing Markov Chains},
year = {2015},
month = {February},
institution = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-15-04},
} 2019-07-02T10:51:13-04:00