Gaussian concentration bounds for stochastic chains of unbounded memory

Abstract

Stochastic chains of unbounded memory (SCUMs) are generalization of Markov chains, also known in the literature as “chains with complete connections” or “g-measures”. We obtain Gaussian concentration bounds (GCB) in this large class of models, for general alphabets, under two different conditions on the kernel: (1) when the sum of its oscillations is less than one, or (2) when the sum of its variations is finite, that is, belongs to ℓ1(N). We also obtain explicit constants as functions of the parameters of the model. Our conditions are sharp in the sense that we exhibit examples of SCUMs that do not have GCB and for which the sum of oscillations is 1+ϵ, or the variation belongs to ℓ1+ϵ(N) for any ϵ>0. These examples are based on the existence of phase transitions. We illustrate our results with four applications. First, we derive a Dvoretzky–Kiefer–Wolfowitz-type inequality which gives a uniform control on the fluctuations of the empirical measure. Second, in the finite-alphabet case, we obtain an upper bound on the d¯-distance between two stationary SCUMs and, as a by-product, we obtain new explicit bounds on the speed of Markovian approximation in d¯. Third, we derive new bounds on the fluctuations of the “plug-in” estimator for entropy. Fourth, we obtain new rate of convergence for the maximum likelihood estimator of conditional probability.