How much does randomness help with locally checkable problems?

02/18/2019
by   Alkida Balliu, et al.
0

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal matchings are examples of LCLs. On the one hand, it is known that some LCLs benefit exponentially from randomness---for example, any deterministic distributed algorithm that finds a sinkless orientation requires Θ( n) rounds in the LOCAL model, while the randomized complexity of the problem is Θ( n) rounds. On the other hand, there are also many LCLs in which randomness is useless. Previously, it was not known if there are any LCLs that benefit from randomness, but only subexponentially. We show that such problems exist: for example, there is an LCL with deterministic complexity Θ(^2 n) rounds and randomized complexity Θ( n n) rounds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2021

Locally Checkable Problems in Rooted Trees

Consider any locally checkable labeling problem Π in rooted regular tree...
research
06/02/2019

On the Use of Randomness in Local Distributed Graph Algorithms

We attempt to better understand randomization in local distributed graph...
research
11/05/2018

The distributed complexity of locally checkable problems on paths is decidable

Consider a computer network that consists of a path with n nodes. The no...
research
04/11/2019

Locality of not-so-weak coloring

Many graph problems are locally checkable: a solution is globally feasib...
research
08/23/2023

Explicit separations between randomized and deterministic Number-on-Forehead communication

We study the power of randomness in the Number-on-Forehead (NOF) model i...
research
07/18/2019

Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems

Consider a graph problem that is locally checkable but not locally solva...
research
08/27/2018

Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation

We study the role of interaction in the Common Randomness Generation (CR...

Please sign up or login with your details

Forgot password? Click here to reset