Chernoff-type bound for finite Markov chains

Annals of Applied Probability

Volumn 8, Issue 3, 1998, Pages 849-867

  Lezaud, Pascal ^a,b  

^a Centre National de la Navigation Aérienne   (France)

^b INSTITUT DE MATHÉMATIQUES DE TOULOUSE   (France)

Author keywords

Chernoff bound; Eigenvalues; Markov chain; Perturbation theory

Indexed keywords

EID: 0032222170     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1028903453     Document Type: Article

References (22)

1. ALDOUS, D. (1987). On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing. Prob. Engrg. Inform. Sci. 1 33-46.
2. ALDOUS, D. and FILL, J. Reversible Markov chains and random walks on graphs. Unpublished manuscript.
3. BAHADUR, R. R. and RANGA RAO, R. (1960). On deviations of the sample mean. Ann. Math. Statist. 31 1015-1033.
4. BENNETT, G. (1962). Probability inequalities for sums of independent random variables. J. Amer. Statist. Assoc. 57 33-45.
5. CHERNOFF, H. (1952). A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23 493-507.
6. CRAMÉR, H. (1938). Sur un nouveau théorème de la théorie des probabilités. Actualités Sci. Indust. 736.
7. DEMBO, A. and ZEITOUNI, O. (1993). Large Deviations Techniques and Applications. Jones and Bartlett, Boston.
8. DIACONIS, P. and SALOFF-COSTE, L. (1993). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3 696-730.
9. DIACONIS, P. and SALOFF-COSTE, L. (1995). What do we know about the Metropolis algorithm? Unpublished manuscript.
10. DIACONIS, P. and SALOFF-COSTE, L. (1996a). Logarithmic Sobolev inequalities and finite Markov chains. Ann. Appl. Probab. 6 695-750.
11. DIACONIS, P. and SALOFF-COSTE, L. (1996b). Nash inequalities for finite Markov chains. J. Appl. Probab. 9 459-510.
12. DINWOODIE, I. (1995). A probability inequality for the occupation measure of a reversible Markov chain. Ann. Appl. Probab. 5 37-43.
13. FILL, J. (1991). Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1 62-87.
14. GILLMAN, D. (1993). Hidden Markov chains: rates of convergence and the complexity of inference. Ph.D. dissertation, MIT.
15. KATO, T. (1966). Perturbation Theory for Linear Operators. Springer, New York.
16. KOLMOGOROV, A. (1929). Über das Gesetz des iterieten Logaritmus. Math. Ann. 99 309-319.
17. MANN, B. (1996). Berry-Esseen central limit theorem for Markov chains. Ph.D. dissertation, Harvard Univ.
18. MARSHALL, A. W. and OLKIN, I. (1979). Inequalities: Theory of Memorization and Its Applications. Academic Press, New York.
19. NAGAEV, S. V. (1957). Some limit theorems for stationary Markov chains. Theory Probab. Appl. 2 378-406.
20. NAGAEV, S. V. (1961). More exact statements of limits theorems for homogeneous Markov chains. Theory Probab. Appl. 6 62-81.
21. STOUT, W. F. (1974). Almost Sure Convergence. Academic Press, New York.
22. TROTTER, H. F. (1959). On the product of semi-groups of operators. Proc. Amer. Math. Soc. 10 545-551.