On the Method of Typical Bounded Differences

  • Lutz Warnke
  • Published 2016 in Combinatorics, Probability & Computing

Abstract

Concentration inequalities are fundamental tools in probabilistic combinatorics and theoretical computer science for proving that random functions are near their means. Of particular importance is the case where f(X) is a function of independent random variables X = (X1, . . . , Xn). Here the well known bounded differences inequality (also called McDiarmid… (More)
DOI: 10.1017/S0963548315000103

Topics

Statistics

05010020142015201620172018
Citations per Year

384 Citations

Semantic Scholar estimates that this publication has 384 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics