Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
TLDR
Fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation and new techniques for proving upper bounds on the tail probabilities of certain random variables which are not stochastically independent are introduced.Abstract:
Certain types of routing, scheduling, and resource-allocation problems in a distributed setting can be modeled as edge-coloring problems We present fast and simple randomized algorithms for edge coloring a graph in the synchronous distributed point-to-point model of computation Our algorithms compute an edge coloring of a graph $G$ with $n$ nodes and maximum degree $\Delta$ with at most $16 \Delta + O(\log^{1+ \delta} n)$ colors with high probability (arbitrarily close to 1) for any fixed $\delta > 0$; they run in polylogarithmic time The upper bound on the number of colors improves upon the $(2 \Delta - 1)$-coloring achievable by a simple reduction to vertex coloring
To analyze the performance of our algorithms, we introduce new techniques for proving upper bounds on the tail probabilities of certain random variables The Chernoff--Hoeffding bounds are fundamental tools that are used very frequently in estimating tail probabilities However, they assume stochastic independence among certain random variables, which may not always hold Our results extend the Chernoff--Hoeffding bounds to certain types of random variables which are not stochastically independent We believe that these results are of independent interest and merit further studyread more
Citations
More filters
Proceedings ArticleDOI
Constraint satisfaction, packet routing, and the lovasz local lemma
TL;DR: A variable-covering radius--type parameter is identified for the infeasible configurations of a given CSP, and an extension of the Lovasz Local Lemma is developed in which many of the events to be avoided have probabilities arbitrarily close to one to lead to a general sufficient condition for the satisfiability of arbitrary CSPs.
Book ChapterDOI
The Price of Low Communication in Secure Multi-party Computation
TL;DR: It is shown that enforcing sublinear communication complexity drastically affects the feasibility bounds on the number of corrupted parties that can be tolerated in the setting of information-theoretic security.
Proceedings ArticleDOI
A simple approach for adapting continuous load balancing processes to discrete settings
TL;DR: A general method that converts a wide class of continuous neighborhood load balancing algorithms into a discrete version that achieves asymptotically lower discrepancies and presents a randomized version of the algorithm balancing the load if the initial load on every node is large enough.
Proceedings ArticleDOI
Effective Construction of Relative Lempel-Ziv Dictionaries
TL;DR: This work develops new dictionary design heuristics, based on effective construction, rather than on pruning; it identifies dictionary construction as a (string) covering problem, and has a similar construction time, but achieves better compression effectiveness.
Book ChapterDOI
Strong Robustness of Randomized Rumor Spreading Protocols
TL;DR: In this paper, it was shown that the quasirandom model is at least as robust as the fully random model despite the greatly reduced degree of independent randomness, and a corresponding lower bound for the classical model was also provided.
References
More filters
Book ChapterDOI
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.
Journal ArticleDOI
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
TL;DR: In this paper, it was shown that the likelihood ratio test for fixed sample size can be reduced to this form, and that for large samples, a sample of size $n$ with the first test will give about the same probabilities of error as a sample with the second test.
Journal ArticleDOI
Locality in distributed graph algorithms
TL;DR: This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data.