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
Perfect matchings and Hamiltonian cycles in the preferential attachment model
TL;DR: In this paper, the existence of perfect matchings and Hamiltonian cycles in the preferential attachment model was studied, and it was shown that there exists a Hamiltonian cycle asymptotically almost surely, provided that √ √ n √ 1{,}260 is a constant.
Posted Content
Maximizing coverage while ensuring fairness: a tale of conflicting objective
TL;DR: A combinatorial optimization framework is formulated, suitable for analysis by researchers in approximation algorithms and related areas, that incorporates fairness in maximum coverage problems as an interplay between $two conflicting objectives.
Journal ArticleDOI
The Local Nature of List Colorings for Graphs of High Girth
TL;DR: The proofs exhibit a certain degree of “locality,” which is exploited to obtain an efficient distributed algorithm able to compute both kinds of optimal list colorings of graphs having girth larger than c\log_{k-1}n.
Book ChapterDOI
Fast algorithms for the free riders problem in broadcast encryption
TL;DR: It is shown that if the differences ai – ai+1, bi–bi+1 are bounded, then there is an O(n4/3/e2/3)-time algorithm for this problem, improving upon the O( n2) time of the naive algorithm.
Posted Content
Continuous Matrix Approximation on Distributed Data
TL;DR: In this paper, the problem of tracking an eps-approximation to the norm of the matrix along any direction is addressed in the distributed streaming model. But the problem requires more care and attention when data comes from multiple distributed sites, each receiving a stream of data.
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.