Practical drift conditions for subgeometric rates of convergence

Annals of Applied Probability

Volumn 14, Issue 3, 2004, Pages 1353-1377

  Douc, Randal ^a,e   Fort, Gersende ^b   Moulines, Eric ^c   Soulier, Philippe ^d  

^a ECOLE POLYTECHNIQUE   (France)

^b LMC   (France)

^c TELECOM PARISTECH   (France)

^d UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

^e CENTRE DE MATHÉMATIQUES APPLIQUÉES   (France)

Author keywords

Markov chains; Rate of convergence; Stationary distribution

Indexed keywords

EID: 21244433219     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051604000000323     Document Type: Article

References (20)

1. ANGONZE, P. (1994). Critères d'ergodicité de modèles markoviens. Estimation non-paramétrique sous des hypothèses de dépendance. Ph.D. dissertation, Univ. Paris 9, Dauphine.
2. ANGONZE, P. (2000). Geometric and subgeometric rates for Markovian processes: A robust approach. Technical report, Univ. de Lille III.
3. DUFLO, M. (1997). Random Iterative Systems. Springer, Berlin.
4. FORT, G. and MOULINES, E. (2000). V-subgeometric ergodicity for a Hastings-Metropolis algorithm. Statist. Probab. Lett. 49 401-410.
5. FORT, G. and MOULINES, E. (2003). Polynomial ergodicity of Markov transition kernels. Stochastic Process. Appl. 103 57-99.
6. GOURIEROUX, C. and ROBERT, C. (2001). Tails and extremal behaviour of stochastic unit root models. Technical report, Centre de Recherche en Economie et Statistique du Travail.
7. GRANGER, C. and SAWNSON, N. (1997). An introduction to stochastic unit-root processes. J. Econometrics 80 35-62.
8. GRUNWALD, G., HYNDMAN, R., TEDESCO, L. and TWEEDIE, R. (2000). Non-Gaussian conditional linear AR(1) models. Aust. N. Z. J. Stat. 42 479-495.
9. JARNER, S. and HANSEN, E. (2000). Geometric ergodicity of Metropolis algorithms. Stochastic Process. Appl. 85 341-361.
10. JARNER, S. and ROBERTS, G. (2002). Polynomial convergence rates of Markov chains. Ann. Appl. Probab. 12 224-247.
11. KLOKOV, S. and VERETENNIKOV, A. (2002). Sub-exponential mixing rate for a class of Markov processes. Technical Report 1, School of Mathematics, Univ. Leeds.
12. MALYSHKIN, M. (2001). Subexponential estimates of the rate of convergence to the invariant measure for stochastic differential equations. Theory Probab. Appl. 45 466-479.
13. MENGERSEN, K. and TWEEDIE, R. (1996). Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24 101-121.
14. MEYN, S. and TWEEDIE, R. (1993). Markov Chains and Stochastic Stability. Springer, London.
15. NUMMELIN, E. and TUOMINEN, P. (1983). The rate of convergence in Orey's theorem for Harris recurrent Markov chains with applications to renewal theory. Stochastic Process. Appl. 15 295-311.
16. ROBERTS, G. and TWEEDIE, R. (1996). Geometric convergence and central limit theorem for multidimensional Hastings and Metropolis algorithms. Biometrika 83 95-110.
17. TANIKAWA, A. (2001). Markov chains satisfying simple drift conditions for subgeometric ergodicity. Stock. Model. 17 109-120.
18. TUOMINEN, P. and TWEEDIE, R. (1994). Subgeometric rates of convergence of f-ergodic Markov chains. Adv. in Appl. Probab. 26 775-798.
19. VERETENNIKOV, A. (1997). On polynomial mixing bounds for stochastic differential equations. Stochastic Process. Appl. 70 115-127.
20. VERETENNIKOV, A. (2000). On polynomial mixing and convergence rate for stochastic differential and difference equations. Theory Probab. Appl. 44 361-374.