Local problems in trees across a wide range of distributed models
<|reference_start|>Local problems in trees across a wide range of distributed models: 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.<|reference_end|>
@article{dhar2024local,
    title={Local problems in trees across a wide range of distributed models},
    author={Anubhav Dhar, Eli Kujawa, Henrik Lievonen, Augusto Modanese, Mikail
  Muftuoglu, Jan Studen'y, and Jukka Suomela},
    journal={arXiv preprint arXiv:2409.13795},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.13795},
    primaryClass={cs.DC}
}