Abstract
We observe that the technique of Markov contraction can be used to establish measure concentration for a broad class of noncontracting chains. In particular, geometric ergodicity provides a simple and versatile framework. This leads to a short, elementary proof of a general concentration inequality for Markov and hidden Markov chains, which supersedes some of the knownresults and easily extends to other processes such as Markov trees. As applications, we provide a Dvoretzky-Kiefer-Wolfowitz-type inequality and a uniform Chernoff bound. All of our bounds are dimension-free and hold for countably infinite state spaces.
| Original language | American English |
|---|---|
| Pages (from-to) | 1-14 |
| Number of pages | 14 |
| Journal | Journal of Applied Probability |
| Volume | 51 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Dec 2014 |
Keywords
- Chernoff
- Concentration of measure
- Dvoretzky-Kiefer-Wolfowitz
- Hidden Markov chain
- Markov chain
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Statistics, Probability and Uncertainty
- General Mathematics
Fingerprint
Dive into the research topics of 'Uniform chernoff and dvoretzky-kiefer-wolfowitz-type inequalities for Markov chains and related processes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver