Concentration inequality for U-statistics of order two for uniformly ergodic Markov chains
Quentin Duchemin (LAMA), Yohann de Castro (ICJ), Claire Lacour (LAMA)

TL;DR
This paper establishes a new concentration inequality for U-statistics of order two in uniformly ergodic Markov chains, extending previous results for independent variables to dependent Markov processes.
Contribution
It introduces a concentration inequality that accounts for dependence in Markov chains with kernels that depend on indices, using martingale and ergodic techniques.
Findings
Recovers the convergence rate of independent case for Markov chains
Allows dependence of kernels on indices, unlike standard methods
Provides sharper bounds when starting from the invariant distribution
Abstract
We prove a new concentration inequality for U-statistics of order two for uniformly ergodic Markov chains. Working with bounded and -canonical kernels, we show that we can recover the convergence rate of Arcones and Gin{\'e} who proved a concentration result for U-statistics of independent random variables and canonical kernels. Our result allows for a dependence of the kernels with the indexes in the sums, which prevents the use of standard blocking tools. Our proof relies on an inductive analysis where we use martingale techniques, uniform ergodicity, Nummelin splitting and Bernstein's type inequality. Assuming further that the Markov chain starts from its invariant distribution, we prove a Bernstein-type concentration inequality that provides sharper convergence rate for small variance terms.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Stochastic processes and statistical mechanics · Advanced Queuing Theory Analysis
