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
Journal ArticleDOI
Online Ramsey games for more than two colors
TL;DR: In this article, the authors used container and sparse regularity techniques to prove a tight upper bound on the typical duration of this game with an arbitrary, but fixed, number of colors for a family of 2-balanced graphs.
Proceedings Article
Sorted Top-k in Rounds
TL;DR: In this paper, the authors consider the sorted top-k problem with pairwise comparisons and show that the optimal sample complexity depends on the number of rounds (up to a polylogarithmic factor for general $r$ and up to a constant factor for $r=1$ or 2).
Posted Content
Fast Algorithms for the Free Riders Problem in Broadcast Encryption.
TL;DR: In this paper, the free riders problem in broadcast encryption was solved in O(n/ε) time, which is independent of the total number of users in the broadcast server.
DissertationDOI
Randomized Rounding and Rumor Spreading with Stochastic Dependencies
TL;DR: The theorem of Beck and Fiala (1981) asserts that for every hypergraph and every set of vertex weights there is a rounding of the vertex weights such that the additive rounding error for all hyperedges is bounded by the maximum degree.
Posted Content
Generic randomness amplification schemes using Hardy paradoxes
TL;DR: This paper presents a device-independent randomness amplification protocol secure against no-signaling adversaries in the simplest experimentally feasible Bell scenario of two parties with two binary inputs, and shows that just as proofs of the Kochen-Specker theorem give rise to pseudo-telepathy games, substructures within these proofs termed $01$-gadgets give birth to Hardy paradoxes.
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.