Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5778946 | Indagationes Mathematicae | 2017 | 13 Pages |
Abstract
Let Yv,vâV, be real-valued random variables having a dependency graph G=(V,E). We show that EâvâVYvâ¤âvâVEYvÏbbbÏb,where Ïb is the b-fold chromatic number of G. This inequality may be seen as a dependency-graph analogue of a generalised Hölder inequality, due to Helmut Finner. Additionally, we provide applications of the aforementioned Hölder-type inequalities to concentration and correlation bounds for sums of weakly dependent random variables whose dependencies can be described in terms of graphs or hypergraphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Mathematics (General)
Authors
Christos Pelekis, Jan Ramon, Yuyi Wang,