Searcharxiv⌕ Search

arXiv · 2609.23098

A short operator proof of Hoeffding inequalities for Markov chains

Abstract

We give a short operator-theoretic proof of the sharp Hoeffding inequality for additive functionals of a Markov chain on a general state space with an $L^2(π)$ spectral gap, recovering the bound of Fan et al. (2021). We further show that the same argument yields the Hoeffding inequality of Neeman et al. (2024) for Markov-dependent random matrices. The proof rests on two key observations. First, the transition operator factors as $P=Q_λ^{1/2} K Q_λ^{1/2}$ through the León-Perron operator $Q_λ$, with $\|K\|=1$. This bounds the moment generating function by a product of one-step operator norms. Second, each one-step operator is a rank-one perturbation of a multiplication operator, so bounding its norm reduces to verifying a scalar resolvent condition. Scalar convexity and the classical Hoeffding lemma then give the desired estimate. This bypasses the asymptotic cumulant generating function, essential-spectrum analysis, and extremal two-state comparison used in existing proofs. In the matrix setting, the multi-matrix Golden-Thompson inequality first reduces the moment generating function to an operator problem on a lifted Hilbert space. The same two steps then apply: the projection onto constants becomes finite-rank, and a Schur-complement argument yields the same scalar estimate. The matrix Hoeffding inequality of Neeman et al. (2024) follows. For complex Hermitian summands, working directly on the complex Hilbert space improves the bound by a factor of $2$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oleksii Kachaiev. 2026-09-19. A short operator proof of Hoeffding inequalities for Markov chains. https://arxiv.org/abs/2609.23098

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Large deviation principle at speed $n^d$ for the random metric in first-passage percolation

We consider the standard first passage percolation model on $\mathbb Z^d$ with bounded weights. We show a large deviation estimate for the probability that the rescaled passage time restricted to a box is greater than a target pseudometric. Moreover, the associated rate function can be written as the integral over the box of an elementary cost. Under the additional assumption that weights are bounded away from zero, the random pseudometric follows a large deviation principle (LDP) at speed $n^d$. Consequences include LDPs at speed $n^d$ for the point-to-point passage time, the crossing passage time and the random ball of radius $n$. Our strategy consists in proving first the existence of the rate function for any seminorm $g$ with a multidimensional subadditivity argument, then using this result as an elementary building block to estimate the rate function in full generality.

math.PR↗

On the Kantorovich contraction of Markov semigroups

We develop an operator-theoretic framework for the contraction properties of Markov semigroups with respect to a general class of Kantorovich semi-distances, which includes Wasserstein distances and weighted total variation norms. The framework is based on Kantorovich contraction coefficients, which extend Dobrushin's ergodic coefficient from the total variation distance to general transport costs. Our main result shows that a geometric drift condition, combined with a local contraction condition on the sub-level sets of the Lyapunov function, implies that the Markov operator is a strict contraction with respect to an explicit modification of the underlying Kantorovich cost. This yields, in a unified way, the existence and uniqueness of invariant measures and exponential decay estimates in Wasserstein distances, for both discrete time and continuous time Markov semigroups, as well as for time-varying semigroups. We illustrate the scope of the framework with (i) Markov transitions on models with boundary states, including bounded domains with entrance boundaries, (ii) operator products of a Markov kernel and its adjoint, including two-block Gibbs samplers, (iii) iterated random functions, including Euler-type schemes, (iv) diffusion models, including overdamped Langevin diffusions with potentials that are convex at infinity, jump-diffusions on compact manifolds, and Jacobi and Riccati matrix diffusions, and (v) time-varying and nonlinear semigroups, including Feynman-Kac distribution flows and Sinkhorn bridges. In several of these settings we obtain new contraction estimates, while in others we recover known results through short and elementary arguments.

math.PR↗

Sharpness of the percolation phase transition for weighted random connection models

We establish the sharpness of the percolation phase transition for a class of potentially infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb R^d$, $d\geq 2$, with intensity $λ>0$, where each vertex carries an independent weight. Given a pair of vertices, an edge is drawn independently with a probability that depends on both their spatial displacement and their respective weights. Our geometric and moment assumptions allow the expected degree to be unbounded over the weights. We prove exponential tails for the number of vertices in the root cluster throughout the subcritical regime. We also obtain a linear lower bound on the percolation probability near criticality from above. The class of systems considered includes min-reach models, Poisson--Boolean overlap models, and suitable softened versions thereof. Our proof combines a finite-volume lattice approximation with Hutchcroft's exploration approach to the OSSS inequality.

math.PR↗