Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/sublinear-time-distributed-algorithms-for-detecting-small-cliques-and-d0QZuAzlnf
References (43)
-
Michael Elkin, Ofer Neiman (2016)
Distributed Strong Diameter Network Decomposition: Extended AbstractProceedings of the 2016 ACM Symposium on Principles of Distributed Computing
-
Janne Korhonen, J. Rybicki (2017)
Deterministic Subgraph Detection in Broadcast CONGESTArXiv, abs/1705.10195
-
D. Watts, S. Strogatz (1998)
Collective dynamics of ‘small-world’ networksNature, 393
-
Jeanette Schmidt, A. Siegel, A. Srinivasan (1995)
Chernoff-Hoeffding bounds for applications with limited independence -
T. Gonen, R. Oshman (2017)
Lower Bounds for Subgraph Detection in the CONGEST Model -
C. Nash-Williams (1961)
Edge-disjoint spanning trees of finite graphsJournal of The London Mathematical Society-second Series, 36
-
Andrew Drucker, F. Kuhn, R. Oshman (2014)
On the power of the congested clique modelProceedings of the 2014 ACM symposium on Principles of distributed computing
-
G. Miller, Richard Peng, S. Xu (2013)
Parallel graph decompositions using random shiftsProceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
-
M. Ghaffari, F. Kuhn (2018)
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set -
K. Censor-Hillel, P. Kaski, Janne Korhonen, C. Lenzen, A. Paz, J. Suomela (2015)
Algebraic methods in the congested cliqueDistributed Computing, 32
-
D. Dolev, C. Lenzen, Shir Peled (2012)
"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract)ArXiv, abs/1201.6652
-
A. Malpani, D. Agrawal (1989)
Efficient information dissemination in computer networks[1989] Proceedings. 14th Conference on Local Computer Networks
-
Yi-Jun Chang, Thatchaphol Saranurak (2019)
Improved Distributed Expander Decomposition and Nearly Optimal Triangle EnumerationProceedings of the 2019 ACM Symposium on Principles of Distributed Computing
-
M. Ghaffari, F. Kuhn, Hsin-Hao Su (2017)
Distributed MST and Routing in Almost Mixing TimeProceedings of the ACM Symposium on Principles of Distributed Computing
-
M. Jerrum, A. Sinclair (1989)
Approximating the PermanentSIAM J. Comput., 18
-
G. Even, O. Fischer, P. Fraigniaud, T. Gonen, R. Levi, Moti Medina, Pedro Montealegre, D. Olivetti, R. Oshman, I. Rapaport, Ioan Todinca (2017)
Three Notes on Distributed Property Testing -
Z. Furedi, M. Simonovits (2013)
The History of Degenerate (Bipartite) Extremal Graph ProblemsarXiv: Combinatorics
-
Mohit Daga, M. Henzinger, Danupon Nanongkai, Thatchaphol Saranurak (2019)
Distributed edge connectivity in sublinear timeProceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
-
K. Censor-Hillel, E. Fischer, Gregory Schwartzman, Y. Vasudev (2016)
Fast distributed algorithms for testing graph propertiesDistributed Computing, 32
-
O. Fischer, T. Gonen, F. Kuhn, R. Oshman (2018)
Possibilities and Impossibilities for Distributed Subgraph DetectionProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
-
Jacques Verstraëte (2016)
Extremal problems for cycles in graphs -
Yi-Jun Chang, S. Pettie, Hengjie Zhang (2018)
Distributed Triangle Detection via Expander Decomposition -
Gopal Pandurangan, Peter Robinson, Michele Scquizzato (2016)
On the Distributed Complexity of Large-Scale Graph ComputationsProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
-
B. Bukh, Zilin Jiang (2014)
A Bound on the Number of Edges in Graphs Without an Even CycleCombinatorics, Probability and Computing, 26
-
(2012)
Distributed verification andhardness of distributed approximation -
M. Ghaffari (2015)
Near-Optimal Scheduling of Distributed AlgorithmsProceedings of the 2015 ACM Symposium on Principles of Distributed Computing
-
P. Fraigniaud, D. Olivetti (2017)
Distributed Detection of CyclesProceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures
-
Zvika Brakerski, B. Patt-Shamir (2009)
Distributed discovery of large near-cliquesDistributed Computing, 24
-
A. Razborov (1992)
On the Distributional Complexity of DisjointnessTheor. Comput. Sci., 106
-
Norishige Chiba, Takao Nishizeki (1985)
Arboricity and Subgraph Listing AlgorithmsSIAM J. Comput., 14
-
Taisuke Izumi, F. Gall (2017)
Triangle Finding and Listing in CONGEST NetworksProceedings of the ACM Symposium on Principles of Distributed Computing
-
Leonid Barenboim, Michael Elkin (2013)
Distributed Graph Coloring: Fundamentals and Recent Developments -
Alexander Golovnev, A. Kulikov (2018)
Circuit Depth ReductionsElectron. Colloquium Comput. Complex., TR18
-
S. Wasserman, Katherine Faust (1994)
Social Network Analysis: Methods and Applications, 8
-
Václav Rozhoň, M. Ghaffari (2019)
Polylogarithmic-time deterministic network decomposition and distributed derandomizationProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
-
Flavio Chierichetti, Silvio Lattanzi, A. Panconesi (2010)
Almost tight bounds for rumour spreading with conductance -
A. Naor, Jacques Verstraëte (2005)
A Note on Bipartite Graphs Without 2k-CyclesCombinatorics, Probability and Computing, 14
-
Michael Szell, S. Thurner (2009)
Measuring social dynamics in a massive multiplayer online gameSoc. Networks, 32
-
J. Bondy, M. Simonovits (1974)
Cycles of even length in graphsJournal of Combinatorial Theory, Series B, 16
-
M. Ghaffari, Jason Li (2018)
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel AlgorithmsArXiv, abs/1805.04764
-
A. Czumaj, C. Konrad (2018)
Detecting cliques in CONGEST networksDistributed Computing, 33
-
Publisher's Note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations -
P. Fraigniaud, I. Rapaport, Ville Salo, Ioan Todinca (2016)
Distributed Testing of Excluded SubgraphsArXiv, abs/1605.03719
- Publisher
- Springer Journals
- Copyright
- Copyright © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2021
- ISSN
- 0178-2770
- eISSN
- 1432-0452
- DOI
- 10.1007/s00446-021-00409-3
- Publisher site
- See Article on Publisher Site
Abstract
In this paper we give sublinear-time distributed algorithms in the CONGEST\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\mathsf {CONGEST}$$\end{document} model for finding or listing cliques and even-length cycles. We show for the first time that all copies of 4-cliques and 5-cliques in the network graph can be detected and listed in sublinear time, O(n5/6+o(1))\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$O(n^{5/6+o(1)})$$\end{document} rounds and O(n73/75+o(1))\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$O(n^{73/75+o(1)})$$\end{document} rounds, respectively. For even-length cycles, C2k\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$C_{2k}$$\end{document}, we give an improved sublinear-time algorithm, which exploits a new connection to extremal combinatorics. For example, for 6-cycles we improve the running time from O~(n5/6)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\tilde{O}}(n^{5/6})$$\end{document} to O~(n3/4)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\tilde{O}}(n^{3/4})$$\end{document} rounds. We also show two obstacles on proving lower bounds for C2k\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$C_{2k}$$\end{document}-freeness: first, we use the new connection to extremal combinatorics to show that the current lower bound of Ω~(n)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\tilde{\varOmega }}(\sqrt{n})$$\end{document} rounds for 6-cycle freeness cannot be improved using partition-based reductions from 2-party communication complexity, the technique by which all known lower bounds on subgraph detection have been proven to date. Second, we show that there is some fixed constant δ∈(0,1/2)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\delta \in (0,1/2)$$\end{document} such that for anyk, a lower bound of Ω(n1/2+δ)\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$\varOmega (n^{1/2+\delta })$$\end{document} on C2k\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$C_{2k}$$\end{document}-freeness would imply new lower bounds in circuit complexity. We use the same technique to show a barrier for proving any polynomial lower bound on triangle-freeness. For general subgraphs, it was shown by Fischer et al. that for any fixed k, there exists a subgraph H of size k such that H-freeness requires Ω~(n2-Θ(1/k))\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\tilde{\varOmega }}(n^{2-\varTheta (1/k)})$$\end{document} rounds. It was left as an open problem whether this is tight, or whether some constant-sized subgraph requires truly quadratic time to detect. We show that in fact, for any subgraph H of constant size k, the H-freeness problem can be solved in O(n2-Θ(1/k))\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$$O(n^{2 - \varTheta (1/k)})$$\end{document} rounds, nearly matching the lower bound.
Journal
Distributed Computing – Springer Journals
Published: Jun 1, 2022
Keywords: Distributed computing; Subgraph freeness; Expander decomposition; CONGEST