Completing the Node-Averaged Complexity Landscape of LCLs on Trees
Authors: 
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav SchmidAuthors Info & Claims
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, Gustav SchmidAuthors Info & ClaimsPages 369 - 379
Abstract
The node-averaged complexity of a problem captures the number of rounds nodes of a graph have to spend on average to solve the problem in the LOCAL model. A challenging line of research with regards to this new complexity measure is to understand the complexity landscape of locally checkable labelings (LCLs) on families of bounded-degree graphs. Particularly interesting in this context is the family of bounded-degree trees as there, for the worst-case complexity, we know a complete characterization of the possible complexities and structures of LCL problems. A first step for the node-averaged complexity case has been achieved recently [DISC '23], where the authors in particular showed that in bounded-degree trees, there is a large complexity gap: There are no LCL problems with a deterministic node-averaged complexity between ω(log* n) and no(1). For randomized algorithms, they even showed that the node-averaged complexity is either O(1) or nΩ(1). In this work we fill in the remaining gaps and give a complete description of the node-averaged complexity landscape of LCLs on bounded-degree trees. Our contributions are threefold.
• On bounded-degree trees, there is no LCL with a node-averaged complexity between ω(1) and (log* n)o(1).
• For any constants 0 < r1 < r2 ≤ 1 and ε > 0, there exists a constant c and an LCL problem with node-averaged complexity between Ω((log* n)c) and O((log* n)c+ε).
• For any constants 0 < α ≤ 1/2 and ε > 0, there exists an LCL problem with node-averaged complexity Θ(nx) for some x ∈ [α, α + ε].
References
[1]
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Jan Studený, and Jukka Suomela. 2022. Efficient Classification of Locally Checkable Problems in Regular Trees. In Proc. 36th International Symposium on Distributed Computing,(DISC 2022). 8:1--8:19.
[2]
Alkida Balliu, Sebastian Brandt, Yi-Jun Chang, Dennis Olivetti, Mikaël Rabie, and Jukka Suomela. 2019. The distributed complexity of locally checkable problems on paths is decidable. In Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM Press, 262--271. arXiv:1811.01672
[3]
Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, and Jukka Suomela. 2020. Classification of distributed binary labeling problems. In Proc. 34th International Symposium on Distributed Computing (DISC 2020) (LIPIcs, Vol. 179). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 17:1--17:17.
[4]
Alkida Balliu, Sebastian Brandt, Manuela Fischer, Rustam Latypov, Yannic Maus, Dennis Olivetti, and Jara Uitto. 2022. Exponential Speedup over Locality in MPC with Optimal Memory. In 36th International Symposium on Distributed Computing, (DISC 2022). 9:1--9:21.
[5]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Gustav Schmid. 2023. On the Node-Averaged Complexity of Locally Checkable Problems on Trees. In 37th International Symposium on Distributed Computing, DISC 2023, October 10-12, 2023, L'Aquila, Italy (LIPIcs, Vol. 281), Rotem Oshman (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 7:1--7:21.
[6]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Gustav Schmid. 2023. On the Node-Averaged Complexity of Locally Checkable Problems on Trees. CoRR abs/2308.04251 (2023).
[7]
Alkida Balliu, Sebastian Brandt, Fabian Kuhn, Dennis Olivetti, and Gustav Schmid. 2024. Completing the Node-Averaged Complexity Landscape of LCLs on Trees. Technical Report 2405.01366. arXiv. Full version of this paper.
[8]
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, Jan Studený, Jukka Suomela, and Aleksandr Tereshchenko. 2021. Locally Checkable Problems in Rooted Trees. In Proc. 40th ACM Symposium on Principles of Distributed Computing (PODC 2021). 263--272.
[9]
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, and Jukka Suomela. 2020. How much does randomness help with locally checkable problems?. In Proc. 39th ACM Symposium on Principles of Distributed Computing (PODC 2020). ACM Press, 299--308. arXiv:1902.06803
[10]
Alkida Balliu, Sebastian Brandt, Dennis Olivetti, and Jukka Suomela. 2021. Almost global problems in the LOCAL model. Distributed Comput. 34, 4 (2021), 259--281.
[11]
Alkida Balliu, Keren Censor-Hillel, Yannic Maus, Dennis Olivetti, and Jukka Suomela. 2021. Locally Checkable Labelings with Small Messages. In 35th International Symposium on Distributed Computing, DISC 2021. 8:1--8:18.
[12]
Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, and Dennis Olivetti. 2023. Node and edge averaged complexities of local graph problems. Distributed Comput. 36, 4 (2023), 451--473.
[13]
Alkida Balliu, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Dennis Olivetti, and Jukka Suomela. 2018. New classes of distributed time complexity. In Proc. 50th ACM Symposium on Theory of Computing (STOC 2018). ACM Press, 1307--1318. arXiv:1711.01871
[14]
Alkida Balliu, Juho Hirvonen, Dennis Olivetti, and Jukka Suomela. 2019. Hardness of minimal symmetry breaking in distributed computing. In Proc. 38th ACM Symposium on Principles of Distributed Computing (PODC 2019). ACM Press, 369--378. arXiv:1811.01643
[15]
Leonid Barenboim and Yaniv Tzur. 2019. Distributed symmetry-breaking with improved vertex-averaged complexity. In Proc. 20th Int. Conf. on Distributed Computing and Networking (ICDCN). 31--40.
[16]
Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, and Przemyslaw Uznanski. 2017. LCL Problems on Grids. In Proc. 36th ACM Symposium on Principles of Distributed Computing (PODC 2017). 101--110.
[17]
Yi-Jun Chang, Tsvi Kopelowitz, and Seth Pettie. 2019. An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model. SIAM J. Comput. 48, 1 (2019), 122--143.
[18]
Yi-Jun Chang and Seth Pettie. 2019. A Time Hierarchy Theorem for the LOCAL Model. SIAM J. Comput. 48, 1 (2019), 33--69.
[19]
Yi-Jun Chang. 2020. The Complexity Landscape of Distributed Locally Checkable Problems on Trees. In Proc. 34th International Symposium on Distributed Computing (DISC 2020) (LIPIcs, Vol. 179). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 18:1--18:17.
[20]
Yi-Jun Chang, Jan Studený, and Jukka Suomela. 2021. Distributed graph problems through an automata-theoretic lens. In Proc. 28th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2021) (LNCS). Springer. arXiv:2002.07659
[21]
Laurent Feuilloley. 2017. How Long It Takes for an Ordinary Node with an Ordinary ID to Output?. In Proc. 24th Int. Coll. on Structural Information and Communication Complexity (SIROCCO), Vol. 10641. 263--282.
[22]
Mohsen Ghaffari and Fabian Kuhn. 2021. Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. IEEE, 1009--1020.
[23]
Christoph Grunau, Václav Rozhon, and Sebastian Brandt. 2022. The Landscape of Distributed Complexities on Trees and Beyond. In Proc. 41st ACM Symposium on Principles of Distributed Computing (PODC 2022). 37--47.
[24]
Nathan Linial. 1992. Locality in Distributed Graph Algorithms. SIAM J. Comput. 21, 1 (1992), 193--201.
[25]
Moni Naor and Larry J. Stockmeyer. 1995. What Can be Computed Locally? SIAM J. Comput. 24, 6 (1995), 1259--1277.
Index Terms
- Completing the Node-Averaged Complexity Landscape of LCLs on Trees
Recommendations
The Landscape of Distributed Complexities on Trees and Beyond
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe study the local complexity landscape of locally checkable labeling (LCL) problems on constant-degree graphs with a focus on complexities below log* n. Our contribution is threefold: (1) Our main contribution is that we complete the classification of ...
Node and Edge Averaged Complexities of Local Graph Problems
PODC'22: Proceedings of the 2022 ACM Symposium on Principles of Distributed ComputingWe continue the recently started line of work on the distributed node-averaged complexity of distributed graph algorithms. The node-averaged complexity of a distributed algorithm running on a graph G=(V,E) is the average over the times at which the ...
Node and edge averaged complexities of local graph problems
AbstractWe continue the recently started line of work on the distributed node-averaged complexity of distributed graph algorithms. The node-averaged complexity of a distributed algorithm running on a graph is the average over the times at which ...
Comments
Information & Contributors
Information
Published In
June 2024
570 pages
ISBN:9798400706684
DOI:10.1145/3662158
- Chair:
- Ran Gelles,
- Proceedings Chair:
- Dennis Olivetti,
- Program Chair:
- Petr Kuznetsov
This work is licensed under a Creative Commons Attribution-NonCommercial International 4.0 License.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 June 2024
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- MUR (Italy)
- PNRR MIUR
- MUR
Conference
Acceptance Rates
Overall Acceptance Rate 740 of 2,477 submissions, 30%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 33Total Downloads
- Downloads (Last 12 months)33
- Downloads (Last 6 weeks)10
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in