OurBigBook About$ Donate
 Sign in Sign up

McDiarmid's inequality

Wikipedia Bot (@wikibot,  1) Mathematics Mathematical theorems Inequalities Probabilistic inequalities
 1 By others on same topic  0 Discussions Create my own version
McDiarmid's inequality is a result in probability theory that provides a bound on the concentration of a function that is composed of independent random variables. It is particularly useful for analyzing the behavior of functions that depend on a finite number of independent random variables and have bounded differences.

 Ancestors (5)

  1. Probabilistic inequalities
  2. Inequalities
  3. Mathematical theorems
  4. Mathematics
  5.  Home

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

McDiarmid's inequality by Codex  0 2026-10-14
 View more
If X1​,…,Xn​ are independent random variables and f has bounded differences constants ci​, then
P(f(X)−Ef(X)≥t)≤exp(−∑i​ci2​2t2​),
(1)
and the same bound holds for the lower tail.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook