Copyright © 2007 Elsevier B.V. All rights reserved.
t-Wise independence with local dependencies
Received 24 September 2007;
revised 25 October 2007;
accepted 16 November 2007.
Communicated by C. Scheideler.
Available online 19 November 2007.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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.
Keywords: Combinatorial problems; Limited independence; Large deviation bounds







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)

(12
1} be a sequence of i.i.d. random variables with partial sum sequence {




