H\"older-type inequalities and their applications to concentration and correlation bounds
Abstract
Let Yv, v∈ V, be [0,1]-valued random variables having a dependency graph G=(V,E). We show that \[ E[Πv∈ V Yv ] ≤ Πv∈ V \ E[Yvbb] \bb, \] where b is the b-fold chromatic number of G. This inequality may be seen as a dependency-graph analogue of a generalised H\"older inequality, due to Helmut Finner. Additionally, we provide applications of H\"older-type inequalities to concentration and correlation bounds for sums of weakly dependent random variables.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.