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
Group Fairness in Committee Selection
TL;DR: The main result is to show that stable lotteries always exist for these canonical voter preference models, and the procedure for computing an approximately stable lottery is the same for both models and therefore extends to the setting where some voters have the former preference structure and others have the latter.
Posted Content
Better Streaming Algorithms for the Maximum Coverage Problem.
Andrew McGregor,Hoa T. Vu +1 more
TL;DR: The main goal of this work is to design algorithms, with approximation guarantees as close as possible to 1−1/e$1-1/ e$, that use sublinear space o(mn)$o(mn), and to study the maximum k-vertex coverage problem in the dynamic graph stream model.
Proceedings Article
Equitable Coloring Extends Chernoff-Hoeffding Bounds
TL;DR: 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.
Journal ArticleDOI
Virtualized Resource Sharing in Cloud Radio Access Networks Through Truthful Mechanisms
TL;DR: This work designs an offline C-RAN auction mechanism that can achieve truthfulness and near-optimal social welfare and designs an online algorithm that executes in polynomial time and achieves a competitive ratio of $(1-\epsilon )$ .
Proceedings ArticleDOI
Combinatorial Auctions Do Need Modest Interaction
TL;DR: This paper provides an almost tight round-approximation tradeoff for this problem: it is shown that for any r ≥ 1, any r-round protocol that uses poly(m,n) bits of communication can only approximate the social welfare up to a factor of Ω(1 over r).
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.