Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams

Authors Suman K. Bera, Amit Chakrabarti



PDF
Thumbnail PDF

File

LIPIcs.STACS.2017.11.pdf
  • Filesize: 0.56 MB
  • 14 pages

Document Identifiers

Author Details

Suman K. Bera
Amit Chakrabarti

Cite As Get BibTex

Suman K. Bera and Amit Chakrabarti. Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.STACS.2017.11

Abstract

We revisit the much-studied problem of space-efficiently estimating the number of triangles in a graph stream, and extensions of this problem to counting fixed-sized cliques and cycles. For the important special case of counting triangles, we give a 4-pass, (1 +/- epsilon)-approximate, randomized algorithm using O-tilde(epsilon^(-2) m^(3/2) / T) space, where m is the number of edges and T is a promised lower bound on the number of triangles. This matches the space bound of a recent algorithm (McGregor et al., PODS 2016), with an arguably simpler and more general technique. We give an improved multi-pass lower bound of Omega(min{m^(3/2)/T , m/sqrt(T)}), applicable at essentially all densities Omega(n) <= m <= O(n^2). We prove other multi-pass lower bounds in terms of various structural parameters of the input graph. Together, our results resolve a couple of open questions raised in recent work (Braverman et al., ICALP 2013).

Our presentation emphasizes more general frameworks, for both upper and lower bounds. We give a sampling algorithm for counting arbitrary subgraphs and then improve it via combinatorial means in the special cases of counting odd cliques and odd cycles. Our results show that these problems are considerably easier in the cash-register streaming model than in the turnstile model, where previous work had focused. We use Turán graphs and related gadgets to derive lower bounds for counting cliques and cycles, with triangle-counting lower bounds following as a corollary.

Subject Classification

Keywords
  • data streaming
  • graph algorithms
  • triangles
  • subgraph counting
  • lower bounds

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Farid Ablayev. Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theor. Comput. Sci., 175(2):139-159, 1996. Google Scholar
  2. Noga Alon, Yossi Matias, and Mario Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58(1):137-147, 1999. Preliminary version in Proc. 28th Annual ACM Symposium on the Theory of Computing , pages 20-29, 1996. Google Scholar
  3. Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar. Reductions in streaming algorithms, with an application to counting triangles in graphs. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 623-632, 2002. Google Scholar
  4. Luca Becchetti, Paolo Boldi, Carlos Castillo, and Aristides Gionis. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pages 16-24, 2008. Google Scholar
  5. Béla Bollobás. Extremal Graph Theory. Academic Press, New York, NY, 1978. Google Scholar
  6. John A. Bondy and Miklós Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, pages 97-105, 1974. Google Scholar
  7. Vladimir Braverman, Rafail Ostrovsky, and Dan Vilenchik. How hard is counting triangles in the streaming model? In Proc. 40th International Colloquium on Automata, Languages and Programming, pages 244-254, 2013. Google Scholar
  8. Luciana S. Buriol, Gereon Frahling, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Christian Sohler. Counting triangles in data streams. In Proc. 25th ACM Symposium on Principles of Database Systems, pages 253-262, 2006. Google Scholar
  9. Amit Chakrabarti. CS49: Data Stream Algorithms Lecture Notes, Fall 2011. URL: http://www.cs.dartmouth.edu/~ac/Teach/data-streams-lecnotes.pdf.
  10. Norishige Chiba and Takao Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput., 14(1):210-223, 1985. Google Scholar
  11. Graham Cormode and Hossein Jowhari. A second look at counting triangles in graph streams. Theoretical Computer Science, 552:44-51, 2014. Google Scholar
  12. David Easley and Jon Kleinberg. Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press, 2012. Google Scholar
  13. Talya Eden, Amit Levi, Dana Ron, and C. Seshadhri. Approximately counting triangles in sublinear time. In Proc. 56th Annual IEEE Symposium on Foundations of Computer Science, pages 614-633, 2015. Google Scholar
  14. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, and Jian Zhang. On graph problems in a semi-streaming model. Theor. Comput. Sci., 348(2-3):207-216, 2005. Preliminary version in Proc. 31st International Colloquium on Automata, Languages and Programming , pages 531-543, 2004. Google Scholar
  15. David Garcıa-Soriano and Konstantin Kutzkov. Triangle counting in streamed graphs via small vertex covers. Tc, 2:3, 2014. Google Scholar
  16. Oded Goldreich. A brief introduction to property testing. In Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman, pages 465-469. Springer, 2011. URL: http://dx.doi.org/10.1007/978-3-642-22670-0_31.
  17. Oded Goldreich. Introduction to testing graph properties. In Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman, pages 470-506. Springer, 2011. URL: http://dx.doi.org/10.1007/978-3-642-22670-0_32.
  18. Madhav Jha, C. Seshadhri, and Ali Pinar. A space efficient streaming algorithm for triangle counting using the birthday paradox. In Proc. 19th Annual SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 589-597, 2013. Google Scholar
  19. Hossein Jowhari and Mohammad Ghodsi. New streaming algorithms for counting triangles in graphs. In Computing and Combinatorics, pages 710-716. Springer, 2005. Google Scholar
  20. Bala Kalyanasundaram and Georg Schintger. The probabilistic communication complexity of set intersection. SIAM J. Disc. Math., 5(4):545-557, 1992. Google Scholar
  21. Daniel M Kane, Kurt Mehlhorn, Thomas Sauerwald, and He Sun. Counting arbitrary subgraphs in data streams. In Proc. 39th International Colloquium on Automata, Languages and Programming, pages 598-609, 2012. Google Scholar
  22. Konstantin Kutzkov and Rasmus Pagh. Triangle counting in dynamic graph streams. In Proc. 14th Scandinavian Symposium and Workshops on Algorithm Theory, pages 306-318, 2014. Google Scholar
  23. Madhusudan Manjunath, Kurt Mehlhorn, Konstantinos Panagiotou, and He Sun. Approximate counting of cycles in streams. In Proc. 19th Annual European Symposium on Algorithms, pages 677-688, 2011. Google Scholar
  24. Andrew McGregor, Sofya Vorotnikova, and Hoa T. Vu. Better algorithms for counting triangles in data streams. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 401-411, 2016. Google Scholar
  25. S. Muthukrishnan. Data streams: Algorithms and applications. Found. Trends Theor. Comput. Sci., 1(2):117-236, 2005. URL: http://dx.doi.org/10.1561/0400000002.
  26. Mark E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003. URL: http://dx.doi.org/10.1137/S003614450342480.
  27. Rasmus Pagh and Charalampos E. Tsourakakis. Colorful triangle counting and a mapreduce implementation. Information Processing Letters, 112(7):277-281, 2012. Google Scholar
  28. Aduri Pavan, Kanat Tangwongsan, Srikanta Tirthapura, and Kun-Lung Wu. Counting and sampling triangles from a graph stream. Proceedings of the VLDB Endowment, 6(14):1870-1881, 2013. Google Scholar
  29. Alexander A. Razborov. On the distributional complexity of disjointness. Theor. Comput. Sci., 106(2):385-390, 1992. Google Scholar
  30. Siddharth Suri and Sergei Vassilvitskii. Counting triangles and the curse of the last reducer. In Proceedings of the 20th international conference on World wide web, pages 607-614, 2011. Google Scholar
  31. Stanley Wasserman and Katherine Faust. Social network analysis: Methods and applications, volume 8. Cambridge university press, 1994. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail