## The Annals of Probability

### How Often Does a Harris Recurrent Markov Chain Recur?

Xia Chen

#### Abstract

Let ${X _n}_ {n\geq 0}$ be a Harris recurrent Markov chain with state space $(E,\mathscr{E})$, transition probability $P(x, A)$ and invariant measure $\pi$ . Given a nonnegative $\pi$-integrable function $f$ on $E$, the exact asymptotic order is given for the additive functionals

in the forms of both weak and strong convergences. In particular, the frequency of ${X_n}_{n \geq 0}$ visiting a given set $A\in \mathscr{E}$ with $0 < \pi (A) < + \infty$ is determined by taking $f = I_A$. Under the regularity assumption, the limits in our theorems are identified. The one- and two-dimensional random walks are taken as the examples of applications.

#### Article information

Source
Ann. Probab., Volume 27, Number 3 (1999), 1324-1346.

Dates
First available in Project Euclid: 29 May 2002

https://projecteuclid.org/euclid.aop/1022677449

Digital Object Identifier
doi:10.1214/aop/1022677449

Mathematical Reviews number (MathSciNet)
MR1733150

Zentralblatt MATH identifier
0981.60023

#### Citation

Chen, Xia. How Often Does a Harris Recurrent Markov Chain Recur?. Ann. Probab. 27 (1999), no. 3, 1324--1346. doi:10.1214/aop/1022677449. https://projecteuclid.org/euclid.aop/1022677449

#### References

• de Acosta, A. (1988). Large deviations for vector-valued functional of a Markov chain: lower bounds. Ann. Probab. 16 925-960.
• de Acosta, A. and Chen, X. (1998). Moderate deviations for empirical measures of Markov chains: upper bounds. J. Theoret. Probab. 11 1075-1110.
• Athreya, K. B. and Ney, P. (1978). A new approach to the limit theory of recurrent Markov chains. Trans. Amer. Math. Soc. 245 493-501.
• Chen, X. (1998). The law of the iterated logarithm for functionals of Harris recurrent Markov chains: self normalization. J. Theoret. Probab. To appear.
• Cs´aki, E. and Cs ¨org o, M. (1995). On additive functionals of Markov chains. J. Theoret. Probab. 8 905-919.
• Darling, D. A. (1952). The influence of the maximum term in the addition of independent random variables. Trans. Amer. Math. Soc. 73 95-107.
• Darling, D. A. and Kac, M. (1957). On occupation times for Markoff processes. Trans. Amer. Math. Soc. 84 444-458.
• Dembo, A. and Zeitouni, O. (1993). Large Deviations Techniques and Applications. Jones and Bartlett, Boston.
• Duflo, M. (1997). Random Iterative Models. Springer, New York.
• Feller, W. (1971). An Introduction to Probability Theory and Its Applications 2, 2nd ed. Wiley, New York.
• Krengel, U. (1966). On the global limit behaviour of Markov chains and of general nonsigular Markov processes.Wahrsch. Verw. Gebiete 6 302-316.
• Kuelbs, J. (1981). When is the cluster set of Sn/an empty? Ann. Probab. 9 377-394.
• Le Gall, J.-F. and Rosen, J. (1991). The range of stable random walks. Ann. Probab. 19 650-705. Marcus, M. B. and Rosen, J. (1994a). Law of the iterated logarithm for the local times of symmetric L´evy processes and recurrent random walks. Ann. Probab. 22 626-658. Marcus, M. B. and Rosen, J. (1994b). Laws of the iterated logarithm for the local times of random walks on Z2 and of L´evy processes and random walks in the domain of attraction of Cauchy random variables. Ann. Inst. H. Poincar´e Probab. Statist. 30 467-499.
• Meyn, S. P. and Tweedie, R. L. (1993). Markov Chains and Stochastic Stability. Springer, London.
• Nummelin, E. (1978). A splitting technique for Harris recurrent chains.Wahrsch. Verw. Gebiete 43 309-318.
• Nummelin, E. (1984). General Irreducible Markov Chains and Non-negative Operators. Cambridge Univ. Press.
• Orey, S. (1971). Limit Theorems for Markov Chain Transition Probabilities. Van Nostrand Reinhold, London.
• R´ev´esz, P. (1990). Random Walk in Random and Non-Random Environments. World Scientific, London.
• Revuz, D. (1975). Markov Chains. North-Holland, Amsterdam.
• Touati, A. (1990). Loi functionelle du logarithme it´er´e pour les processus de Markov r´ecurrents. Ann. Probab. 18 140-159.