Equitable Coloring Extends Chernoff-Hoeffding Bounds

Authors:
Sriram V. Pemmaraju
Affiliations:
-
Venue:
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Year:
2001

Citing 3
Cited 6

Randomized algorithms

Randomized algorithms
Chernoff-Hoeffding Bounds for Applications with Limited Independence

SIAM Journal on Discrete Mathematics
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds

SIAM Journal on Computing

Equitable colorings of Kronecker products of graphs

Discrete Applied Mathematics
Chromatic PAC-Bayes Bounds for Non-IID Data: Applications to Ranking and Stationary β-Mixing Processes

The Journal of Machine Learning Research
Toeplitz compressed sensing matrices with applications to sparse channel estimation

IEEE Transactions on Information Theory
Equitable colorings of Cartesian products of graphs

Discrete Applied Mathematics
On the necessity of irrelevant variables

The Journal of Machine Learning Research
A polyhedral approach for the equitable coloring problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.06

Visualization

Abstract

Chernoff-Hoeffding bounds are sharp tail probability bounds for sums of bounded independent random variables. Often we cannot avoid dependence among random variables involved in the sum. In some cases the theory of martingales has been used to obtain sharp bounds when there is a limited amount of dependence. This paper will present a simple but powerful new technique that uses the existence of small sized equitable graph colorings to prove sharp Chernoff-Hoeffding type concentration results for sums of random variables with dependence. This technique also allows us to focus on the dependency structure of the random variables and in cases where the dependency structure is a tree or an outerplanar graph, it allows us to derive bounds almost as sharp as those obtainable had the random variables been mutually independent. This technique connects seemingly unrelated topics: extremal graph theory and concentration inequalities. The technique also motivates several open questions in equitable graph colorings, positive answers for which will lead to surprisingly strong Chernoff-Hoeffding type bounds.