Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators

We develop techniques to prove lower bounds for the BCAST(log n) Broadcast Congested Clique model (a distributed message passing model where in each round, each processor can broadcast an O(log n)-sized message to all other processors). Our techniques are built to prove bounds for natural input distributions. So far, all lower bounds for problems in the model relied on constructing specifically tailored graph families for the specific problem at hand, resulting in lower bounds for artificially constructed inputs, instead of natural input distributions. One of our results is a lower bound for the directed planted clique problem. In this problem, an input graph is either a random directed graph (each directed edge is included with probability 1/2), or a random graph with a planted clique of size k. That is, k randomly chosen vertices have all of the edges between them included, and all other edges in the graph appear with probability 1/2. The goal is to determine whether a clique exists. We show that when k = n(1/4 - ε), this problem requires a number of rounds polynomial in n. Additionally, we construct a pseudo-random generator which fools the Broadcast Congested Clique. This allows us to show that every k round randomized algorithm in which each processor uses up to n random bits can be efficiently transformed into an O(k)-round randomized algorithm in which each processor uses only up to O(k log n) random bits, while maintaining a high success probability. The pseudo-random generator is simple to describe, computationally very cheap, and its seed size is optimal up to constant factors. However, the analysis is quite involved, and is based on the new technique for proving lower bounds in the model. The technique also allows us to prove the first average case lower bound for the Broadcast Congested Clique, as well as an average-case time hierarchy. We hope our technique will lead to more lower bounds for problems such as triangle counting, APSP, MST, diameter, and more, for natural input distributions.

[1]  Andrea Montanari,et al.  Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems , 2015, COLT.

[2]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Pravesh Kothari,et al.  A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[4]  Fabian Kuhn,et al.  On the power of the congested clique model , 2014, PODC.

[5]  Mark Jerrum,et al.  Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

[6]  Tomasz Jurdzinski,et al.  Brief Announcement: On Connectivity in the Broadcast Congested Clique , 2017, DISC.

[7]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

[8]  Mihir Bellare,et al.  Distributed pseudo-random bit generators—a new way to speed-up shared coin tossing , 1996, PODC '96.

[9]  Janne H. Korhonen,et al.  Deterministic Subgraph Detection in Broadcast CONGEST , 2017, OPODIS.

[10]  Pierre Fraigniaud,et al.  Towards a complexity theory for local distributed computing , 2013, JACM.

[11]  Seth Pettie,et al.  A Time Hierarchy Theorem for the LOCAL Model , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[12]  Sidhanth Mohanty,et al.  Algorithms for Noisy Broadcast with Erasures , 2018, ICALP.

[13]  Ryan O'Donnell,et al.  Analysis of Boolean Functions , 2014, ArXiv.

[14]  Robert Krauthgamer,et al.  The Probable Value of the Lovász--Schrijver Relaxations for Maximum Independent Set , 2003, SIAM J. Comput..

[15]  Luca Trevisan,et al.  On Worst-Case to Average-Case Reductions for NP Problems , 2005, Electron. Colloquium Comput. Complex..

[16]  Tomasz Jurdzinski,et al.  MSF and Connectivity in Limited Variants of the Congested Clique , 2017, ArXiv.

[17]  Jukka Suomela,et al.  Towards a Complexity Theory for the Congested Clique , 2018, SPAA.

[18]  Ivan Rapaport,et al.  Brief Announcement: A Hierarchy of Congested Clique Models, from Broadcast to Unicast , 2015, PODC.

[19]  Artur Czumaj,et al.  Detecting cliques in CONGEST networks , 2018, Distributed Computing.

[20]  Christoph Lenzen,et al.  Algebraic methods in the congested clique , 2015, Distributed Computing.

[21]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[22]  Stephan Holzer,et al.  Approximation of Distances and Shortest Paths in the Broadcast Congest Clique , 2014, OPODIS.

[23]  Huacheng Yu,et al.  Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation , 2018, Electron. Colloquium Comput. Complex..

[24]  Prasad Raghavendra,et al.  On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique , 2016, SODA.

[25]  Pedro Montealegre-Barba,et al.  Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested Clique , 2016, PODC.

[26]  François Le Gall,et al.  Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems , 2016, DISC.

[27]  Noga Alon,et al.  The Space Complexity of Approximating the Frequency Moments , 1999 .

[28]  Ludek Kucera,et al.  Expected Complexity of Graph Partitioning Problems , 1995, Discret. Appl. Math..

[29]  Noam Nisan,et al.  Pseudorandomness for network algorithms , 1994, STOC '94.

[30]  Fabian Kuhn,et al.  On Derandomizing Local Distributed Algorithms , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[31]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[32]  Joan Feigenbaum,et al.  Random-Self-Reducibility of Complete Sets , 1993, SIAM J. Comput..

[33]  Moni Naor,et al.  Distributed Pseudo-random Functions and KDCs , 1999, EUROCRYPT.

[34]  Fabian Kuhn,et al.  On the complexity of local distributed graph problems , 2016, STOC.

[35]  Ivan Rapaport,et al.  Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model , 2016, Networks.

[36]  Danupon Nanongkai,et al.  A tight unconditional lower bound on distributed randomwalk computation , 2011, PODC '11.

[37]  Shahar Dobzinski,et al.  Economic efficiency requires interaction , 2019, Games Econ. Behav..

[38]  U. Feige,et al.  Finding and certifying a large hidden clique in a semirandom graph , 2000 .

[39]  Ronald de Wolf,et al.  A Brief Introduction to Fourier Analysis on the Boolean Cube , 2008, Theory Comput..

[40]  Yuval Peres,et al.  Finding Hidden Cliques in Linear Time with High Probability , 2010, Combinatorics, Probability and Computing.

[41]  David Peleg,et al.  Distributed verification and hardness of distributed approximation , 2010, STOC '11.

[42]  Roger Wattenhofer,et al.  Networks cannot compute their diameter in sublinear time , 2012, SODA.

[43]  Pedro Montealegre-Barba,et al.  The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique Model , 2018, LATIN.

[44]  Boaz Patt-Shamir,et al.  Improved distributed steiner forest construction , 2014, PODC '14.

[45]  Eylon Yogev,et al.  Congested Clique Algorithms for Graph Spanners , 2018, DISC.

[46]  Omri Weinstein,et al.  ETH Hardness for Densest-k-Subgraph with Perfect Completeness , 2015, SODA.

[47]  Gregory Schwartzman,et al.  Derandomizing local distributed algorithms under bandwidth restrictions , 2016, Distributed Computing.

[48]  Ami Paz,et al.  Distributed Construction of Purely Additive Spanners , 2016, DISC.

[49]  Avi Wigderson,et al.  Sum-of-squares Lower Bounds for Planted Clique , 2015, STOC.