Relative entropy and exponential deviation bounds for general markov chains

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1563-1567

  Kontoyiannis, I ^a   Lastras Montano L A ^b   Meyn, S P ^c  

^a BROWN UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DOEBLIN CHAINS; ELEMENTARY TOOLS; HOEFFDING BOUNDS;

COMPUTER SIMULATION; ENTROPY; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING;

MARKOV PROCESSES;

EID: 33749435449     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523607     Document Type: Conference Paper

References (16)

1. J.R. Baxter, N.C. Jain, and S.R.S. Varadhan. Some familiar examples for which the large deviation principle does not hold. Comm. Pure Appl. Math., 44(8-9):911-923, 1991.
2. P. Brémaud. Markov chains, volume 31 of Texts in Applied Mathematics. Springer-Verlag, New York, 1999. Gibbs fields, Monte Carlo simulation, and queues.
3. W. Bryc and A. Dembo. Large deviations and strong mixing. Ann. Inst. H. Poincaré Probab. Statist., 32(4):549-569, 1996.
4. T.M. Cover and J.A. Thomas. Elements of Information Theory. J. Wiley, New York, 1991.
5. I. Csiszár. Sanov property, generalized I-projection and a conditional limit theorem. Ann. Probab., 12(3):768-793, 1984.
6. I. Csiszár. The method of types. IEEE Trans. Inform. Theory, 44(6):2505-2523, 1998. Information theory: 1948-1998.
7. I. Csiszár, T.M. Cover, and B.S. Choi. Conditional limit theorems under Markov conditioning. IEEE Trans. Inform. Theory, 33(6):788-801, 1987.
8. P.W. Glynn and D. Ormoneit. Hoeffding's inequality for uniformly ergodic Markov chains. Statist. Probab. Lett., 56(2):143-146, 2002.
9. W. Hoeffding. Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc., 58:13-30, 1963.
10. C.A. León and F. Perron. Optimal Hoeffding bounds for discrete reversible Markov chains. Ann. Appl. Probab., 14(2):958-970, 2004.
11. P. Lezaud. Chernoff-type bound for finite Markov chains. Ann. Appl. Probab., 8(3):849-867, 1998.
12. J.S. Liu. Monte Carlo strategies in scientific computing. Springer Series in Statistics. Springer-Verlag, New York, 2001.
13. S.P. Meyn and R.L. Tweedie. Markov Chains and Stochastic Stability. Springer-Verlag, London, 1993.
14. C. Pandit. Robust Statistical Modeling Based On Moment Classes With Applications to Admission Control, Large Deviations and Hypothesis Testing. PhD thesis, Dept. of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 2004.
15. S.R.S. Varadhan. Large Deviations and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa., 1984.
16. G. Winkler. Image Analysis, Random Fields and Dynamic Monte Carlo Methods: A Mathematical Introduction. Springer-Verlag, Berlin, 1995.