t-Wise Independence with Local Dependencies
classification
🧮 math.PR
math.STstat.TH
keywords
variablesdependencyindependentrandomarbitrarilyboundboundedchromatic
read the original abstract
In this note we prove a large deviation bound on the sum of random variables with the following dependency structure: there is a dependency graph $G$ with a bounded chromatic number, in which each vertex represents a random variable. Variables that are represented by neighboring vertices may be arbitrarily dependent, but collections of variables that form an independent set in $G$ are $t$-wise independent.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.