Distributed Triangle Detection is Hard in Few Rounds

2025-04-02

AI Summary

This paper establishes a lower bound on the number of communication rounds required for triangle detection in the synchronous distributed CONGEST model, where an $n$-vertex graph is distributed among nodes—each aware only of its incident edges—and each edge supports $O(log n)$ bits of communication per round. Method: Moving beyond prior single-round lower bounds, the authors introduce a novel technical framework that integrates multi-pass graph streaming information-theoretic techniques with point-to-point communication modeling, thereby circumventing inherent limitations of standard two-party communication reductions. Contribution/Results: Via rigorous information-theoretic analysis and a lower-bound proof for randomized protocols, they prove a tight $Omega(log log n)$ round lower bound for triangle detection. This constitutes the first super-constant round lower bound for any subgraph detection problem in the CONGEST model, significantly advancing the theoretical understanding of fundamental limits in distributed graph computation.

Technology Category

• Constraint Satisfaction and Optimization: Distributed CSP/Optimization
• Search and Optimization: Distributed Search
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Graph Algorithms and Modeling for the Web: Representation, reconstruction, and subgraph or motif discovery in Web-related graphs
• Web Mining and Content Analysis: Content-based information diffusion
• Social Networks and Social Media: Influence propagation, information diffusion, and the prediction on networks

Abstract

In the distributed triangle detection problem, we have an $n$-vertex network $G=(V,E)$ with one player for each vertex of the graph who sees the edges incident on the vertex. The players communicate in synchronous rounds using the edges of this network and have a limited bandwidth of $O(log{n})$ bits over each edge. The goal is to detect whether or not $G$ contains a triangle as a subgraph in a minimal number of rounds. We prove that any protocol (deterministic or randomized) for distributed triangle detection requires $Omega(loglog{n})$ rounds of communication. Prior to our work, only one-round lower bounds were known for this problem. The primary technique for proving these types of distributed lower bounds is via reductions from two-party communication complexity. However, it has been known for a while that this approach is provably incapable of establishing any meaningful lower bounds for distributed triangle detection. Our main technical contribution is a new information theoretic argument which combines recent advances on multi-pass graph streaming lower bounds with the point-to-point communication aspects of distributed models, and can be of independent interest.

Problem

• Detect triangles in distributed networks efficiently
• Establish lower bounds for communication rounds
• Combine streaming and communication complexity techniques

Innovation

• New information theoretic argument
• Multi-pass graph streaming lower bounds
• Point-to-point communication aspects