t-wise independence with local dependencies

DOI10.1016/J.IPL.2007.11.010zbMATH Open1186.68327arXiv0706.1637OpenAlexW2094806697MaRDI QIDQ963369FDOQ963369

Ronen Gradwohl, Amir Yehudayoff

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0706.1637

zbMATH Keywords

combinatorial problemslarge deviation boundslimited independence

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Probability Inequalities for Sums of Bounded Random Variables
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Large deviations for sums of partly dependent random variables
• Large Robust Games
• The infamous upper tail
• Hidden word statistics
• Partial exposure in large games
• Random walks with \(k\)-wise independent increments

Cited In (1)

• Hoeffding's inequality for sums of dependent random variables

This page was built for publication: \(t\)-wise independence with local dependencies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963369)