t-Wise Independence with Local Dependencies
Probability
2007-06-13 v1 Statistics Theory
Statistics Theory
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 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 are -wise independent.
Cite
@article{arxiv.0706.1637,
title = {t-Wise Independence with Local Dependencies},
author = {Ronen Gradwohl and Amir Yehudayoff},
journal= {arXiv preprint arXiv:0706.1637},
year = {2007}
}