Sharp Decoupling Inequalities for the Variances and Second Moments of Sums of Dependent Random Variables
Abstract
Both complete decoupling and tangent decoupling are classical tools aiming to compare two random processes where one has a weaker dependence structure. We give a new proof for the complete decoupling inequality, which provides a lower bound for the sum of dependent square-integrable nonnegative random variables Σni=1 di \[ 12 E ( Σni=1 zi )2 ≤ E ( Σni=1 di )2, \] where zi L= di for all i≤ n and zi's are mutually independent. We will then provide the following sharp tangent decoupling inequalities \[ Var ( Σni=1 di) ≤ 2 Var ( Σni=1 ei),\] and \[ E ( Σni=1 di)2 ≤ 2 E ( Σni=1 ei)2 - [ E ( Σni=1 ei) ]2,\] where \ei\ is the decoupled sequences of \di\ and di's are not forced to be nonnegative. Applications to construct Chebyshev-type inequality and Paley-Zygmund-type inequality, and to bound the second moments of randomly stopped sums will be provided.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.