Document Open Access Logo

On the Complexity of Triangle Counting Using Emptiness Queries

Authors Arijit Bishnu, Arijit Ghosh, Gopinath Mishra

PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2023.48.pdf
  • Filesize: 0.97 MB
  • 22 pages

Document Identifiers

Author Details

Arijit Bishnu
  • Indian Statistical Institute, Kolkata, India
Arijit Ghosh
  • Indian Statistical Institute, Kolkata, India
Gopinath Mishra
  • University of Warwick, Coventry, UK

Funding

  • Mishra, Gopinath: Research supported in part by the Centre for Discrete Mathematics and its Applications (DIMAP), by EPSRC award EP/V01305X/13.

Cite AsGet BibTex

Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra. On the Complexity of Triangle Counting Using Emptiness Queries. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 275, pp. 48:1-48:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.48

Abstract

Beame et al. [ITCS'18 & TALG'20] introduced and used the Bipartite Independent Set (BIS) and Independent Set (IS) oracle access to an unknown, simple, unweighted and undirected graph and solved the edge estimation problem. The introduction of this oracle set forth a series of works in a short time that either solved open questions mentioned by Beame et al. or were generalizations of their work as in Dell and Lapinskas [STOC'18 and TOCT'21], Dell, Lapinskas, and Meeks [SODA'20 and SICOMP'22], Bhattacharya et al. [ISAAC'19 & TOCS'21], and Chen et al. [SODA'20]. Edge estimation using BIS can be done using polylogarithmic queries, while IS queries need sub-linear but more than polylogarithmic queries. Chen et al. improved Beame et al.’s upper bound result for edge estimation using IS and also showed an almost matching lower bound. Beame et al. in their introductory work asked a few open questions out of which one was on estimating structures of higher order than edges, like triangles and cliques, using BIS queries. In this work, we almost resolve the query complexity of estimating triangles using BIS oracle. While doing so, we prove a lower bound for an even stronger query oracle called Edge Emptiness (EE) oracle, recently introduced by Assadi, Chakrabarty, and Khanna [ESA'21] to test graph connectivity.

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
  • Theory of computation → Lower bounds and information complexity
Keywords
  • Triangle Counting
  • Emptiness Queries
  • Bipartite Independent Set Query

Metrics

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

Related Versions

References

  1. Sepehr Assadi, Deeparnab Chakrabarty, and Sanjeev Khanna. Graph Connectivity and Single Element Recovery via Linear and OR Queries. In Petra Mutzel, Rasmus Pagh, and Grzegorz Herman, editors, 29th Annual European Symposium on Algorithms, ESA 2021, September 6-8, 2021, Lisbon, Portugal (Virtual Conference), volume bisbisbisbis204 of LIPIcs, pages 7:1-7:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. URL: https://doi.org/10.4230/LIPIcs.ESA.2021.7.
  2. Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna. A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. In Proceedings of the 10th Innovations in Theoretical Computer Science Conference, ITCS, volume 124, pages 6:1-6:20, 2019. Google Scholar
  3. Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar. Reductions in Streaming Algorithms, with an Application to Counting Triangles in Graphs. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 623-632, 2002. Google Scholar
  4. Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, and Makrand Sinha. Edge Estimation with Independent Set Oracles. In Proceedings of the 9th Innovations in Theoretical Computer Science Conference, ITCS, volume 94, pages 38:1-38:21, 2018. Google Scholar
  5. Paul Beame, Sariel Har-Peled, Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian, and Makrand Sinha. Edge Estimation with Independent Set Oracles. ACM Trans. Algorithms, 16(4):52:1-52:27, 2020. Google Scholar
  6. Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra. Hyperedge Estimation using Polylogarithmic Subset Queries. CoRR, abs/1908.04196, 2019. URL: https://arxiv.org/abs/1908.04196.
  7. Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra. Triangle Estimation Using Tripartite Independent Set Queries. In Proceedings of the 30th International Symposium on Algorithms and Computation, ISAAC, volume 149, pages 19:1-19:17, 2019. Google Scholar
  8. Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra. On Triangle Estimation Using Tripartite Independent Set Queries. Theory Comput. Syst., 65(8):1165-1192, 2021. Google Scholar
  9. Arijit Bishnu, Arijit Ghosh, Sudeshna Kolay, Gopinath Mishra, and Saket Saurabh. Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers. In Proceedings of the 29th International Symposium on Algorithms and Computation, ISAAC, volume 123, pages 25:1-25:12, 2018. Google Scholar
  10. Arijit Bishnu, Arijit Ghosh, and Gopinath Mishra. On the Complexity of Triangle Counting using Emptiness Queries. CoRR, abs/2110.03836, 2021. URL: https://arxiv.org/abs/2110.03836.
  11. Xi Chen, Amit Levi, and Erik Waingarten. Nearly Optimal Edge Estimation with Independent Set Queries. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 2916-2935, 2020. Google Scholar
  12. Holger Dell and John Lapinskas. Fine-Grained Reductions from Approximate Counting to Decision. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC, pages 281-288, 2018. Google Scholar
  13. Holger Dell, John Lapinskas, and Kitty Meeks. Approximately Counting and Sampling Small Witnesses Using a Colourful Decision Oracle. In Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 2201-2211, 2020. Google Scholar
  14. Talya Eden, Amit Levi, Dana Ron, and C. Seshadhri. Approximately Counting Triangles in Sublinear Time. SIAM J. Comput., 46(5):1603-1646, 2017. Google Scholar
  15. Talya Eden, Dana Ron, and C. Seshadhri. On Approximating the Number of k-Cliques in Sublinear Time. SIAM J. Comput., 49(4):747-771, 2020. Google Scholar
  16. Uriel Feige. On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph. SIAM J. Comput., 35(4):964-984, 2006. Google Scholar
  17. Oded Goldreich. Introduction to Property Testing. Cambridge University Press, 2017. Google Scholar
  18. Oded Goldreich and Dana Ron. Property Testing in Bounded Degree Graphs. Algorithmica, 32(2):302-343, 2002. Google Scholar
  19. Oded Goldreich and Dana Ron. Approximating Average Parameters of Graphs. Random Struct. Algorithms, 32(4):473-493, 2008. Google Scholar
  20. 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, PODS, pages 401-411, 2016. Google Scholar
  21. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. In Algorithms and Theory of Computation Handbook, Chapman & Hall/CRC Applied Algorithms and Data Structures series. CRC Press, 1999. Google Scholar
  22. Cyrus Rashtchian, David P. Woodruff, and Hanlin Zhu. Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems. In Proceedings of the 24th International Conference on Randomization and Computation, RANDOM, volume 176, pages 26:1-26:20, 2020. Google Scholar
  23. Dana Ron and Gilad Tsur. The Power of an Example: Hidden Set Size Approximation Using Group Queries and Conditional Sampling. ACM Trans. Comput. Theory, 8(4):15:1-15:19, 2016. Google Scholar
  24. Larry J. Stockmeyer. The Complexity of Approximate Counting (Preliminary Version). In Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC, pages 118-126, 1983. Google Scholar
  25. Larry J. Stockmeyer. On Approximation Algorithms for #P. SIAM J. Comput., 14(4):849-861, 1985. 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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact