A Tail Bound for Read-k Families of Functions

Abstract

We prove a Chernoff-like large deviation bound on the sum of non-independent random variables that have the following dependence structure. The variables Y1,...,Yr are arbitrary Boolean functions of independent random variables X1,...,Xm, modulo a restriction that every Xi influences at most k of the variables Y1,...,Yr.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…