announcement

Public Access

Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model

Authors:

Yi-Jun Chang,

Tsvi Kopelowitz, and

Seth PettieAuthors Info & Claims

PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing

July 2016

Pages 195 - 197

https://doi.org/10.1145/2933057.2933079

Published: 25 July 2016 Publication History

PDF eReader

Abstract

Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially faster than the best deterministic algorithm. In this paper we prove that these exponential gaps are necessary and establish numerous connections between the deterministic and randomized complexities in the LOCAL model. Each of our results has a very compelling take-away message:

Fast Δ-coloring of trees requires random bits. Building on the recent randomized lower bounds of Brandt et al. [6], we prove that the randomized complexity of Δ-coloring a tree with maximum degree Δ is θ(log_Δ log n), for any Δ ≥ 55, whereas its deterministic complexity is θ(log_Δ n) for any Δ ≥ 3. This also establishes a large separation between the deterministic complexity of Δ-coloring and (Δ+1)-coloring trees.

Randomized lower bounds imply deterministic lower bounds. We prove that any deterministic algorithm for a natural class of problems that runs in O(1) + o(log_Δ n) rounds can be transformed to run in O(log* n -- log*Δ + 1) rounds. If the transformed algorithm violates a lower bound (even allowing randomization), then one can conclude that the problem requires Ω(log_Δ n) time deterministically. (This gives an alternate proof that deterministically Δ-coloring a tree with small Δ takes Ω(log_Δ n) rounds.)

Deterministic lower bounds imply randomized lower bounds. We prove that the randomized complexity of any natural problem on instances of size n is at least its deterministic complexity on instances of size √log n}. This shows that a deterministic Ω(log_Δ n) lower bound for any problem (Δ-coloring a tree, for example) implies a randomized Ω(log_Δ log n) lower bound. It also illustrates that the graph shattering technique employed in recent randomized symmetry breaking algorithms is absolutely essential to the LOCAL model. For example, it is provably impossible to improve the 2^O(√log log n) terms in the complexities of the best MIS and (Δ+1)-coloring algorithms without also improving the 2^O(√log n})-round Panconesi-Srinivasan algorithms.

References

[1]

R. Bar-Yehuda, K. Censor-Hillel, and G. Schwartzman. A distributed (2+ε)-approximation for vertex cover in O(łogΔ/ε łogłogΔ) rounds. In Proceedings 35th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2016.

Abstract

References

Cited By

Index Terms

Recommendations

An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets

Can We Break Symmetry with o(m) Communication?

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Funding Sources

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations