Abstract
In this note we study the probability and the
mean time for absorption for discrete time Markov chains. In particular, we are
interested in estimating the mean time for absorption when
absorption is not certain and connect it with some other known
results. Computing a suitable probability generating function, we are able to estimate the mean time for absorption when absorption is not certain giving some applications concerning the random walk. Furthermore, we investigate the probability for a Markov chain to reach a set A before reach B generalizing this result for a sequence of sets
References
[1] J. Kemeny and J. Snell, Finite Markov Chains, Springer, Berlin, 1974. Search in Google Scholar
[2] T. Sheskin, Conditional mean first passage time in a Markov chain, Int. J. Manag. Sci. Eng. Manag. 8 (2013), 32–37. 10.1080/17509653.2013.783187Search in Google Scholar
[3] Y. Suhov and Mark Kelbert, Markov Chains: A Primer in Random Processes and Their Applications, Cambridge University, Cambridge, 2008. Search in Google Scholar
[4] D. Walker, The expected time until absorption when absorption is not certain, J. Appl. Probab. 35 (1998), 812–823. 10.1239/jap/1032438377Search in Google Scholar
© 2021 Walter de Gruyter GmbH, Berlin/Boston
