A constructive proof of a concentration bound for real-valued random variables

DOI10.1016/j.ipl.2020.105942zbMath1453.60060arXiv1905.01172OpenAlexW2943083973MaRDI QIDQ2308463

Natalia Shenkman, Wolfgang Mulzer

Publication date: 3 April 2020

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmsconcentration boundgeneralized Chernoff-Hoeffding bound

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Computational methods for problems pertaining to probability theory (60-08) Randomized algorithms (68W20)

Cites Work

• Hoeffding's inequality for sums of dependent random variables
• Constructive Proofs of Concentration Bounds
• Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A constructive proof of a concentration bound for real-valued random variables