Hostname: page-component-7f64f4797f-7vssv Total loading time: 0 Render date: 2025-11-03T21:59:38.711Z Has data issue: false hasContentIssue false
  • English
  • Français

Large Deviation Bounds for Markov Chains

Published online by Cambridge University Press:  01 December 1997

NABIL KAHALE
NABIL KAHALE
Affiliation:
AT&T Labs–Research, Florham Park, NJ 07932, USA; (e-mail: kahale@research.att.com)
Get access Rights & Permissions [Opens in a new window]

Abstract

We study the fraction of time that a Markov chain spends in a given subset of states. We give an exponential bound on the probability that it exceeds its expectation by a constant factor. Our bound depends on the mixing properties of the chain, and is asymptotically optimal for a certain class of Markov chains. It beats the best previously known results in this direction. We present an application to the leader election problem.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 4 , December 1997 , pp. 465 - 474
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable