QUANTITATIVE CONVERGENCE RATES OF MARKOV CHAINS: A SIMPLE ACCOUNT

被引:40
作者
Rosenthal, Jeffery S. [1 ]
机构
[1] Univ Toronto, Dept Stat, Toronto, ON M5S 3G3, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Markov chain; convergence rate; mixing time; drift condition; minorisation condition; total variation distance;
D O I
10.1214/ECP.v7-1054
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We state and prove a simple quantitative bound on the total variation distance after k iterations between two Markov chains with different initial distributions but identical transition probabilities. The result is a simplified and improved version of the result in Rosenthal (1995), which also takes into account the epsilon-improvement of Roberts and Tweedie (1999), and which follows as a special case of the more complicated time-inhomogeneous results of Douc et al. (2002). However, the proof we present is very short and simple; and we feel that it is worth-while to boil the proof down to its essence. This paper is purely expository; no new results are presented.
引用
收藏
页码:123 / 128
页数:6
相关论文
共 22 条
[1]   SHIFT-COUPLING [J].
ALDOUS, DJ ;
THORISSON, H .
STOCHASTIC PROCESSES AND THEIR APPLICATIONS, 1993, 44 (01) :1-14
[2]  
[Anonymous], 1992, Stochastic Stability of Markov chains
[3]   NEW APPROACH TO THE LIMIT THEORY OF RECURRENT MARKOV-CHAINS [J].
ATHREYA, KB ;
NEY, P .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1978, 245 (NOV) :493-501
[4]  
Bickel P. J., 2002, IN PRESS
[5]  
Cowles M. K., 2001, STAT COMPUT IN PRESS
[6]   A simulation approach to convergence rates for Markov chain Monte Carlo algorithms [J].
Cowles, MK ;
Rosenthal, JS .
STATISTICS AND COMPUTING, 1998, 8 (02) :115-124
[7]  
Douc R., 2002, PREPRINT
[8]  
Jones G. L., 2001, STAT SCI IN PRESS
[9]  
Lindvall T., 1992, Lectures on the coupling method
[10]  
Lund RB, 1996, ANN APPL PROBAB, V6, P218