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 where for all and ’s are mutually independent. We will then provide the following sharp tangent decoupling inequalities and where is the decoupled sequences of and ’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.

生成讲解博客的中文版本

生成AI智能校验的中文版本