Anubhav Dhar · Eli Kujawa · Henrik Lievonen · Augusto Modanese · Mikail Muftuoglu · Jan Studený · Jukka Suomela

Local problems in trees across a wide range of distributed models

OPODIS 2024 · 28th International Conference on Principles of Distributed Systems, Lucca, Italy, December 2024

authors’ version arXiv.org

Abstract

The randomized online-LOCAL model captures a number of models of computing; it is at least as strong as all of these models:

  • the classical LOCAL model of distributed graph algorithms,
  • the quantum version of the LOCAL model,
  • finitely dependent distributions [e.g. Holroyd 2016],
  • any model that does not violate physical causality [Gavoille, Kosowski, Markiewicz, DICS 2009],
  • the SLOCAL model [Ghaffari, Kuhn, Maus, STOC 2017], and
  • the dynamic-LOCAL and online-LOCAL models [Akbari et al., ICALP 2023].

In general, the online-LOCAL model can be much stronger than the LOCAL model. For example, there are locally checkable labeling problems (LCLs) that can be solved with logarithmic locality in the online-LOCAL model but that require polynomial locality in the LOCAL model.

However, in this work we show that in trees, many classes of LCL problems have the same locality in deterministic LOCAL and randomized online-LOCAL (and as a corollary across all the above-mentioned models). In particular, these classes of problems do not admit any distributed quantum advantage.

We present a near-complete classification for the case of rooted regular trees. We also fully classify the super-logarithmic region in unrooted regular trees. Finally, we show that in general trees (rooted or unrooted, possibly irregular, possibly with input labels) problems that are global in deterministic LOCAL remain global also in the randomized online-LOCAL model.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.