arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.13795cs.DC
收藏

树中跨广泛分布式模型的局部问题

Local problems in trees across a wide range of distributed models

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

AI总结:

本研究证明在树结构中,许多LCL问题在确定性LOCAL与随机在线-LOCAL模型下具有相同局部性,并给出近乎完整的分类,排除分布式量子优势。

摘要:

随机在线-LOCAL 模型涵盖了许多计算模型;它至少与以下所有模型一样强大:经典分布式图算法的 LOCAL 模型、LOCAL 模型的量子版本、有限依赖分布(例如 Holroyd 2016)、任何不违反物理因果性的模型(Gavoille, Kosowski, Markiewicz, DISC 2009)、SLOCAL 模型(Ghaffari, Kuhn, Maus, STOC 2017)以及动态-LOCAL 和在线-LOCAL 模型(Akbari 等人,ICALP 2023)。一般来说,在线-LOCAL 模型可能比 LOCAL 模型强大得多。例如,存在一些局部可检查标记问题(LCL),它们可以在在线-LOCAL 模型中以对数局部性解决,但在 LOCAL 模型中则需要多项式局部性。然而,在这项工作中,我们表明在树中,许多类别的 LCL 问题在确定性 LOCAL 和随机在线-LOCAL(以及作为推论,在上述所有模型中)中具有相同的局部性。特别是,这些类别的问题不允许任何分布式量子优势。我们针对有根正则树的情况提出了近乎完整的分类。我们还完全分类了无根正则树中的超对数区域。最后,我们表明在一般树(有根或无根,可能不规则,可能带有输入标签)中,在确定性 LOCAL 中是全局的问题在随机在线-LOCAL 模型中仍然是全局的。

英文摘要:

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, DISC 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑