Large Deviation Bounds for Markov Chains

Combinatorics Probability and Computing

Volumn 6, Issue 4, 1997, Pages 465-474

  Kahale, Nabil ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031521198     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003209     Document Type: Article

References (17)

1. Ajtai, M., Komlós, J. and Szemerédi, E. (1987) Deterministic simulation in logspace. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, ACM Press, pp. 132-140.
2. Aldous, D. and Fill, J. (1997) Reversible Markov Chains and random walks on graphs. Monograph in preparation.
3. Aldous, D. (1987) On the Markov Chain simulation method for uniform combinatorial distributions and simulated annealing. Probability in the Engineering and Information Sciences 1 33-46.
4. Chernoff, H. (1952) A measure for asymptotic efficiency of a hypothesis based on the sum of observations. Ann. Math. Statist. 23 493-507.
5. Cohen, A. and Wigderson, A. (1989) Dispersers, deterministic amplification, and weak random sources. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pp. 14-19.
6. Gillman, D. (1994) Personal communication.
7. Gillman, D. (1993) A Chernoff bound for random walks on expander graphs. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pp. 680-691.
8. Goldreich, O., Impagliazzo, R., Levin, L., Venkatesan, R. and Zuckerman, D. (1990) Security preserving amplification of hardness. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pp. 318-326.
9. Hagerup, T., and Rub, C. (1989/90) A guided tour of Chernoff bounds. Inform. Process. Lett. 33 305-308.
10. Hoglund, T. (1974) Central limit theorems and statistical inference for finite Markov Chains. Z. Wahrscheinlichkeitstheorie Verw. Gebiete 29 123-151.
11. Impagliazzo, R. and Zuckerman, D. (1989) How to recycle random bits. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pp. 248-253.
12. Jerrum, M. and Sinclair, A. (1989) Approximating the permanent. SIAM J. Comput. 18 1149-1178.
13. Kahale, N. (1991) Better expansion for Ramanujan graphs. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, pp. 296-303.
14. Lovász, L. and Simonovits, M. (1993) Random walks in a convex body and an improved volume algorithm. Random Strutures & Algorithms 4 359-412.
15. Ostrovsky, R., Rajagopalan, S. and Vazirani, U. (1994) Simple and efficient leader election in the full information model. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, ACM Press, pp. 234-242.
16. Seneta, E. (1981) Non-negative matrices and Markov Chains. Springer.
17. Sinclair, A. and Jerrum, M. (1989) Approximate counting, uniform generation, and rapidly mixing Markov Chains. Information and Computation 82 93-113.