Concentration for self-bounding functions and an inequality of Talagrand

Authors:
Colin McDiarmid;Bruce Reed
Affiliations:
Department of Statistics, University of Oxford, Oxford OX1 3TG, England;Department of Computer Science, McGill University, Montreal, Canada and Laboratoire I3S, CNRS Sophia-Antipolis, France
Venue:
Random Structures & Algorithms
Year:
2006

Citing 4
Cited 0

A sharp concentration inequality with application

Random Structures & Algorithms
Laws of large numbers and tail inequalities for random tries and PATRICIA trees

Journal of Computational and Applied Mathematics - Special issue: Probabilistic methods in combinatorics and combinatorial optimization
Concentration inequalities for functions of independent variables

Random Structures & Algorithms
Probability: Theory and Examples

Probability: Theory and Examples

Quantified Score

Hi-index	0.00

Visualization

Abstract

We see that the entropy method yields strong concentration results for general self-bounding functions of independent random variables. These give an improvement of a concentration result of Talagrand much used in discrete mathematics. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006