Abstract
It is well known that the distributions of hitting times in Markov chains are quite irregular, unless the limit as time tends to infinity is considered. We show that nevertheless for a typical finite irreducible Markov chain and for nondegenerate initial distributions the tails of the distributions of the hitting times for the states of a Markov chain can be ordered, i.e., they do not overlap after a certain finite moment of time. If one considers instead each state of a Markov chain as a source rather than a sink then again the states can generically be ordered according to their efficiency. The mechanisms underlying these two orderings are essentially different though. Our results can be used, e.g., for a choice of the initial distribution in numerical experiments with the fastest convergence to equilibrium/stationary distribution, for characterization of the elements of a dynamical network according to their ability to absorb and transmit the substance (“information”) that is circulated over the network, for determining optimal stopping moments (stopping signals/words) when dealing with sequences of symbols, etc.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abadi, M.: Sharp error terms and necessary conditions for exponential hitting times in mixing processes. Ann. Probab. 32(1A), 243–264 (2004)
Afraimovich, V.S., Bunimovich L.A.: Dynamical networks: interplay of topology, interactions and local dynamics. Nonlinearity 20(7), 1761–1771 (2007)
Afraimovich, V.S., Bunimovich, L.A.: Which hole is leaking the most: a topological approach to study open systems. Nonlinearity 23(3), 643–656 (2010)
Bunimovich, L.A., Yurchenko, A.: Where to place a hole to achieve fastest escape rate. Isr. J. Math. 182, 229–252 (2011)
Chazottes, J.-R., Ugalde, E.: Entropy estimation and fluctuations of hitting and recurrence times for Gibbsian sources. Discrete Contin. Dyn. Syst., Ser. B 5(3), 565–586 (2005)
Feller, W.: An Introduction to Probability Theory and Its Applications, vol. I, 3rd edn. Wiley, New York (1968)
Galves, A., Schmitt, B.: Inequalities for hitting times in mixing dynamical systems. Random Comput. Dyn. 5(4), 337–347 (1997)
Haydn, N., Vaienti, S.: The limiting distribution and error terms for return times of dynamical systems. Discrete Contin. Dyn. Syst. 10(3), 589–616 (2004)
Haydn, N., Lacroix, Y., Vaienti, S.: Hitting and return times in ergodic dynamical systems. Ann. Probab. 33(5), 2043–2050 (2005)
Hirata, M., Saussol, B., Vaienti, S.: Statistics of return times: a general framework and new applications. Commun. Math. Phys. 206(1), 33–55 (1999)
Hirsch, M.W., Smale, S., Devaney, R.L.: Differential equations, dynamical systems, and an introduction to chaos, 2nd edn. Pure and Applied Mathematics (Amsterdam), vol. 60. Elsevier/Academic Press, Amsterdam (2004)
Kac, M.: On the notion of recurrence in discrete stochastic processes. Bull. Am. Math. Soc. 53, 1002–1010 (1947)
Keller, G., Liverani C.: Rare events, escape rates and quasistationarity: some exact formulae. J. Stat. Phys. 135(3), 519–534 (2009)
Kupsa, M., Lacroix, Y.: Asymptotics for hitting times. Ann. Probab. 33(2), 610–619 (2005)
Lacroix, Y.: Possible limit laws for entrance times of an ergodic aperiodic dynamical system. Isr. J. Math. 132, 253–263 (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Bakhtin, Y., Bunimovich, L. The Optimal Sink and the Best Source in a Markov Chain. J Stat Phys 143, 943–954 (2011). https://doi.org/10.1007/s10955-011-0223-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10955-011-0223-x