t-Wise Independence with Local Dependencies

Simple item page
dc.creatorGradwohl, Ronen
dc.creatorYehudayoff, Amir
dc.date2007-06-12
dc.date.accessioned2026-07-07T08:05:14Z
dc.date.available2026-07-07T08:05:14Z
dc.descriptionIn 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.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/0706.1637
dc.identifierhttp://arxiv.org/abs/0706.1637
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130216
dc.subjectProbability
dc.subjectStatistics Theory
dc.subject60C05
dc.titlet-Wise Independence with Local Dependencies
dc.typetext

Files

Collections

arXiv