Optimal hoeffding bounds for discrete reversible Markov chains

Annals of Applied Probability

Volumn 14, Issue 2, 2004, Pages 958-970

  León, Carlos A ^a   Perron, Fraņcois ^b  

^a UNIVERSITY OF CONCEPCIÓN   (Chile)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

Chernoff bounds; Large deviations; Markov chains; Perron Frobenius eigenvalue

Indexed keywords

EID: 26844496127     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051604000000170     Document Type: Article

References (10)

1. DEMBO, A. and ZEITOUNI, O. (1998). Large Deviations Techniques and Applications, 2nd ed. Springer, New York.
2. DINWOODIE, I. H. (1995). A probability inequality for the occupation measure of a reversible Markov chain. Ann. Appl. Probab. 5 37-43.
3. GILLMAN, D. (1993). A Chernoff bound for random walks on expander graphs. In Proc. of the 34th Symposium on Foundations of Computer Science. IEEE Comp. Soc. Press, Palo Alto, CA.
4. GREEN, P. and HAN, X.-L. (1992). Metropolis methods, Gaussian proposals and antithetic variables. Lecture Notes in Statist. 74 142-164. Springer, Berlin.
5. HOEFFDING, W. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13-30.
6. LÉZAUD, P. (1998). Chernoff-type bound for finite Markov chains. Ann. Appl. Probab. 8 849-867.
7. MARSHALL, A. W. and OLKIN, I. (1979). Inequalities: Theory of Memorization and Its Application. Academic Press, New York.
8. METROPOLIS, N., ROSENBLUTH, A. W., ROSENBLUTH, M. N., TELLER, A. H. and TELLER, E. (1953). Equations of state calculations by fast computing machines. J. Chem. Phys. 21 1087-1092.
9. PESKUN, P. H. (1973). Optimum Monte Carlo sampling using Markov chains. Biometrika 60 607-612.
10. SMITH, A. F. M. and ROBERTS, G. O. (1993). Bayesian computations via the Gibbs sampler and related Markov chain Monte Carlo. J. R. Stat. Soc. Ser. B Stat. Methodol. 55 3-23.