Home On the absorption probabilities and mean time for absorption for discrete Markov chains
Article
Licensed
Unlicensed Requires Authentication

On the absorption probabilities and mean time for absorption for discrete Markov chains

  • Nikolaos Halidias EMAIL logo
Published/Copyright: February 2, 2021

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 A1,A2,,Ak.

MSC 2010: 60J10

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

Received: 2020-05-06
Revised: 2020-12-15
Accepted: 2021-01-25
Published Online: 2021-02-02
Published in Print: 2021-06-01

© 2021 Walter de Gruyter GmbH, Berlin/Boston

Downloaded on 26.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/mcma-2021-2084/html?lang=en
Scroll to top button