Randomness vs. Time in Anonymous Networks

@inproceedings{Seidel2015RandomnessVT,
  title={Randomness vs. Time in Anonymous Networks},
  author={Jochen Seidel and Jara Uitto and Roger Wattenhofer},
  booktitle={DISC},
  year={2015}
}
In an anonymous network, symmetry breaking tasks can only be solved if randomization is available. But how many random bits are required to solve any such task? As it turns out, the answer to this question depends on the desired runtime of the algorithm. Since any randomized anonymous network algorithm can be decomposed into a randomized 2-hop coloring stage and a deterministic stage, we tackle the question by focusing on the randomized stage. We establish that for any reasonable target… 
Anonymous distributed computing: computability, randomization and checkability
TLDR
It is proved that every problem that can be solved (and verified) by a randomized anonymous algorithm can also be solved by a deterministic anonymous algorithm provided that the latter is equipped with a 2-hop coloring of the input graph.
Computing in Anonymous Dynamic Networks Is Linear
TLDR
The first linear-time terminating counting algorithm for processes in anonymous 1-interval-connected dynamic networks with a leader is given, which demonstrates that computation in anonymous dynamic networks is practically feasible, and far less demanding than previously conjectured.
A Self-Stabilizing Algorithm for Maximal Matching in Anonymous Networks
TLDR
This work proposes a self-stabilizing algorithm for computing a maximal matching in an anonymous network and provides the best known complexity among all adversarial distributed daemons and with the anonymous assumption.
Adversarial Input in Games and Markets
TLDR
This research is an unusual blend of basic and applied research, proving theorems on the one hand, and building practical systems on the other, and winning Prize for Innovations in Distributed Computing in 2012.
Collaboration in Multi-Agent Systems: Adaptivity and Active Learning
TLDR
This dissertation proposes a new scheme for competitive analysis of recommendation algorithms, and proposes an online algorithm that finds a good item for every agent in the system that has, up to a polylogarithmic factor, an optimal competitive ratio in terms of this new scheme.

References

SHOWING 1-10 OF 45 REFERENCES
Anonymous networks: randomization = 2-hop coloring
TLDR
It is proved that every problem that can be solved (and verified) by a randomized anonymous algorithm can also be solved by a deterministic anonymous algorithm provided that the latter is equipped with a 2-hop coloring of the input graph.
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1992
TLDR
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.
Weak graph colorings: distributed algorithms and applications
  • F. Kuhn
  • Computer Science, Mathematics
    SPAA '09
  • 2009
TLDR
A faster deterministic algorithm for the standard vertex coloring problem on graphs with moderate degrees is obtained, it is shown that in time O(Δ+log*n), a (Γ+1)-coloring can be computed, a task for which the best previous algorithm required time O (Δ*log(Γ) + log*n).
Distributed Graph Coloring: Fundamentals and Recent Developments
TLDR
The objective of this monograph is to provide a treatise on theoretical foundations of distributed symmetry breaking in the message-passing model of distributed computing and to stimulate further progress in this exciting area.
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
Locally checkable proofs
TLDR
It is shown that the proof complexities form a natural hierarchy of complexity classes: for many classical graph problems, the proof complexity is either 0, (1), (log n), or poly(n) bits per node.
What Can Be Computed Locally ?
TLDR
A model for distributed computations and the notion of locally checkable labelings (LCLs) is introduced and properties about algorithms for local checkable labeling problems are proved.
Tight bounds for asynchronous randomized consensus
TLDR
This work proves that the total step complexity of randomized consensus is Θ(n2) in an asynchronous shared memory system using multi-writer multi-reader registers and improves both the lower and the upper bounds for this problem.
An efficient self-stabilizing distance-2 coloring algorithm
Distributed (δ+1)-coloring in linear (in δ) time
TLDR
A deterministic (Δ + 1)-coloring distributed algorithm with running time O(Δ) + 1/2 log* n is presented, which breaks the heuristic barrier of Szegedy and Vishwanathan, and achieves running time which is linear in the maximum degree Δ.
...
...