For a nonempty of relative size at least , its Hamming distance function has the bounded differences property with all constants one. If , the concentration bound at gives , so for . Then , proving that the radius- neighbourhood contains at least cube points.
McDiarmid's inequality 2026-10-14
If are independent random variables and has bounded differences constants , then
and the same bound holds for the lower tail.
The bounded differences property with constants means
whenever and differ only in coordinate . Conditional on , the range of is therefore at most . The range bound on variance gives
Substitution into the Efron–Stein inequality yields
Moving one ball can destroy at most one empty bin and create at most one empty bin; the net number of empty bins therefore changes by at most one. Thus has the bounded differences property with for all ball coordinates. The upper- and lower-tail forms of the McDiarmid inequality give, for ,
Replacing one input coordinate changes the longest increasing subsequence length by at most one, so has the bounded differences property with . The two-sided McDiarmid inequality gives, for ,
The bounded differences property with means that changing only coordinate changes by at most one:
whenever for all .
The function is -certifiable when, whenever , there is a coordinate set with such that every agreeing with on satisfies . The coordinates in form a certificate for the assertion that the value is at least .
Talagrand concentration inequality for certifiable functions Created 2026-09-24 Updated 2026-10-14
This is an application of Talagrand's concentration inequality to certifiable functions. Talagrand's product-space inequality gives sub-Gaussian-type concentration for a bounded-differences, certifiable function, with a variance scale controlled by the certificate size.