Premium
Concentration for self‐bounding functions and an inequality of Talagrand
Author(s) -
McDiarmid Colin,
Reed Bruce
Publication year - 2006
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20145
Subject(s) - bounding overwatch , mathematics , concentration inequality , inequality , struct , random variable , statistical physics , pure mathematics , physics , statistics , mathematical analysis , computer science , artificial intelligence , programming language
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