2000 character limit reached
Bernstein-type Inequalities for Markov Chains and Markov Processes: A Simple and Robust Proof
Published 9 Aug 2024 in math.PR | (2408.04930v3)
Abstract: We establish a new Bernstein-type deviation inequality for general discrete-time Markov chains via an elementary approach. More robust than existing works in the literature, our result only requires the Markov chain to satisfy an iterated Poincar\'e inequality. Moreover, our method can be readily generalized to continuous-time Markov processes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.