Hölder-type inequalities and their applications to concentration and correlation bounds

DOI10.1016/J.INDAG.2016.11.017MaRDI QIDQ505059zbMATH OpenOpenAlexFDO

Authors Christos Pelekis, Jan Ramon, Yuyi Wang

Publication date 18 January 2017

Published in Indagationes Mathematicae. New Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.07204

zbMATH Keywords

hypergraphsfractional chromatic numberdependency graphFinner's inequalityJanson's inequality

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Inequalities; stochastic orderings (60E15) Combinatorial probability (60C05) Hypergraphs (05C65)

Abstract: Let $Y_v,vinV,$ be $[0,1]$-valued random variables having a dependency graph $G=(V,E)$. We show that [ mathbb{E}left[prod_{vin V} Y_{v} ight] leq prod_{vin V} left{ mathbb{E}left[Y_v^{frac{chi_b}{b}} ight] ight}^{frac{b}{chi_b}}, ] where $ch{i}_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.

Recommendations

• A refinement of Hölder's inequality and applications
• Some refinements to Hölder's inequality and applications
• Hölder's inequality: some recent and unexpected applications
• scientific article; zbMATH DE number 5824225
• A generalization of Hölder's inequality and some probability inequalities
• On non-additive probabilistic inequalities of Hölder-type
• scientific article; zbMATH DE number 218850
• scientific article; zbMATH DE number 3914621
• Estimations in Hölder's type inequalities

Cites work

• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A concentration result with application to subgraph count
• A constructive proof of the general Lovász local lemma
• A generalization of Hölder's inequality and some probability inequalities
• A tail bound for read-\(k\) families of functions
• A useful elementary correlation inequality
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• Graph theory
• Large deviations for sums of partly dependent random variables
• New versions of Suen's correlation inequality
• On the probability of independent sets in random graphs
• The number of independent sets in a graph with small maximum degree
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Three problems of Aronszajn in measure theory

This page was built for publication: Hölder-type inequalities and their applications to concentration and correlation bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505059)