Abstract
The multiplayer promise set disjointness is one of the most widely used problems from communication complexity in applications. In this problem there are k players with subsets S¹, …, S^k, each drawn from {1, 2, …, n}, and we are promised that either the sets are (1) pairwise disjoint, or (2) there is a unique element j occurring in all the sets, which are otherwise pairwise disjoint. The total communication of solving this problem with constant probability in the blackboard model is Ω(n/k).
We observe for most applications, it instead suffices to look at what we call the "mostly" set disjointness problem, which changes case (2) to say there is a unique element j occurring in at least half of the sets, and the sets are otherwise disjoint. This change gives us a much simpler proof of an Ω(n/k) randomized total communication lower bound, avoiding Hellinger distance and Poincare inequalities. Our proof also gives strong lower bounds for high probability protocols, which are much larger than what is possible for the set disjointness problem. Using this we show several new results for data streams:
1) for ?₂Heavy Hitters, any O(1)pass streaming algorithm in the insertiononly model for detecting if an ε?₂heavy hitter exists requires min(1/(ε²)log((ε²n)/δ), 1/(ε)n^{1/2}) bits of memory, which is optimal up to a log n factor. For deterministic algorithms and constant ε, this gives an Ω(n^{1/2}) lower bound, improving the prior Ω(log n) lower bound. We also obtain lower bounds for Zipfian distributions.
2) for ?_pEstimation, p > 2, we show an O(1)pass Ω(n^{12/p} log(1/δ)) bit lower bound for outputting an O(1) approximation with probability 1δ, in the insertiononly model. This is optimal, and the best previous lower bound was Ω(n^{12/p} + log(1/δ)).
3) for low rank approximation of a sparse matrix in ℝ^{d× n}, if we see the rows of a matrix one at a time in the roworder model, each row having O(1) nonzero entries, any deterministic algorithm requires Ω(√d) memory to output an O(1)approximate rank1 approximation. Finally, we consider strict and general turnstile streaming models, and show separations between sketching lower bounds and nonsketching upper bounds for the heavy hitters problem.
BibTeX  Entry
@InProceedings{kamath_et_al:LIPIcs.CCC.2021.37,
author = {Kamath, Akshay and Price, Eric and Woodruff, David P.},
title = {{A Simple Proof of a New Set Disjointness with Applications to Data Streams}},
booktitle = {36th Computational Complexity Conference (CCC 2021)},
pages = {37:137:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959771931},
ISSN = {18688969},
year = {2021},
volume = {200},
editor = {Kabanets, Valentine},
publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14311},
URN = {urn:nbn:de:0030drops143119},
doi = {10.4230/LIPIcs.CCC.2021.37},
annote = {Keywords: Streaming algorithms, heavy hitters, communication complexity, information complexity}
}
Keywords: 

Streaming algorithms, heavy hitters, communication complexity, information complexity 
Collection: 

36th Computational Complexity Conference (CCC 2021) 
Issue Date: 

2021 
Date of publication: 

08.07.2021 