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

DOI10.1016/j.indag.2016.11.017zbMath1407.60030arXiv1511.07204OpenAlexW2963955521MaRDI QIDQ505059

Jan Ramon, Yuyi Wang, Christos Pelekis

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

fractional chromatic numberhypergraphsdependency graphFinner's inequalityJanson's inequality

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of independent sets in a graph with small maximum degree
• Three problems of Aronszajn in measure theory
• A useful elementary correlation inequality
• A generalization of Hölder's inequality and some probability inequalities
• A concentration result with application to subgraph count
• A tail bound for read-kfamilies of functions
• A constructive proof of the general lovász local lemma
• New versions of Suen's correlation inequality
• Large deviations for sums of partly dependent random variables
• On the probability of independent sets in random graphs
• Chernoff–Hoeffding Bounds for Applications with Limited Independence