Document Open Access Logo

Testable Properties in General Graphs and Random Order Streaming

Authors Artur Czumaj, Hendrik Fichtenberger , Pan Peng , Christian Sohler

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2020.16.pdf
  • Filesize: 0.58 MB
  • 20 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Streaming, sublinear and near linear time algorithms
Keywords
  • Graph property testing
  • sublinear algorithms
  • graph streaming algorithms

Metrics

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

Abstract

We consider the fundamental question of understanding the relative power of two important computational models: property testing and data streaming. We present a novel framework closely linking these areas in the setting of general graphs in the context of constant-query complexity testing and constant-space streaming. Our main result is a generic transformation of a one-sided error property tester in the random-neighbor model with constant query complexity into a one-sided error property tester in the streaming model with constant space complexity. Previously such a generic transformation was only known for bounded-degree graphs.

Cite As Get BibTex

Artur Czumaj, Hendrik Fichtenberger, Pan Peng, and Christian Sohler. Testable Properties in General Graphs and Random Order Streaming. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 16:1-16:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.16

Author Details

Artur Czumaj
  • Department of Computer Science and Centre for Discrete Mathematics and its Applications (DIMAP), University of Warwick, Coventry, UK
Hendrik Fichtenberger
  • Department of Computer Science, TU Dortmund, Germany
Pan Peng
  • Department of Computer Science, University of Sheffield, UK
Christian Sohler
  • Department of Mathematics and Computer Science, University of Cologne, Germany

Funding

  • Czumaj, Artur: Research partially supported by the Centre for Discrete Mathematics and its Applications (DIMAP), by IBM Faculty Award, and by EPSRC award EP/N011163/1.
  • Fichtenberger, Hendrik: Research supported by ERC grant No. 307696.
  • Sohler, Christian: Research supported by ERC grant No. 307696.

Acknowledgements

We would like to thank anonymous reviewers for extensive comments.

References

  1. Noga Alon, Eldar Fischer, Ilan Newman, and Asaf Shapira. A combinatorial characterization of the testable graph properties: It’s all about regularity. SIAM Journal on Computing, 39(1):143-167, 2009. URL: https://doi.org/10.1137/060667177.
  2. Noga Alon, Tali Kaufman, Michael Krivelevich, and Dana Ron. Testing triangle-freeness in general graphs. SIAM Journal on Discrete Mathematics, 22(2):786-819, 2008. URL: https://doi.org/10.1137/07067917X.
  3. Noga Alon and Asaf Shapira. A characterization of the (natural) graph properties testable with one-sided error. SIAM Journal on Computing, 37(6):1703-1727, 2008. URL: https://doi.org/10.1137/06064888X.
  4. Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab Mirrokni, and Cliff Stein. Coresets meet EDCS: Algorithms for matching and vertex cover on massive graphs. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1616-1635, 2019. Google Scholar
  5. Itai Benjamini, Oded Schramm, and Asaf Shapira. Every minor-closed property of sparse graphs is testable. Advances in Mathematics, 223(6):2200-2218, 2010. Google Scholar
  6. Marc Bury, Elena Grigorescu, Andrew McGregor, Morteza Monemizadeh, Chris Schwiegelshohn, Sofya Vorotnikova, and Samson Zhou. Structural results on matching estimation with applications to streaming. Algorithmica, 81(1):367-392, 2019. Google Scholar
  7. Clément L. Canonne and Tom Gur. An adaptivity hierarchy theorem for property testing. Computational Complexity, 27(4):671-716, 2018. URL: https://doi.org/10.1007/s00037-018-0168-4.
  8. Amit Chakrabarti, Graham Cormode, and Andrew McGregor. Robust lower bounds for communication and stream computation. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), pages 641-650, 2008. Google Scholar
  9. Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, and Sofya Vorotnikova. Vertex ordering problems in directed graph streams. In Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1786-1802, 2020. Google Scholar
  10. Graham Cormode, Hossein Jowhari, Morteza Monemizadeh, and S. Muthukrishnan. The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs. In Proceedings of 25th Annual European Symposium on Algorithms (ESA), pages 29:1-29:15, 2017. URL: https://doi.org/10.4230/LIPIcs.ESA.2017.29.
  11. Artur Czumaj, Morteza Monemizadeh, Krzysztof Onak, and Christian Sohler. Planar graphs: Random walks and bipartiteness testing. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 423-432, 2011. URL: https://doi.org/10.1109/FOCS.2011.69.
  12. Artur Czumaj, Pan Peng, and Christian Sohler. Relating two property testing models for bounded degree directed graphs. In Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC), pages 1033-1045, 2016. Google Scholar
  13. Artur Czumaj, Asaf Shapira, and Christian Sohler. Testing hereditary properties of nonexpanding bounded-degree graphs. SIAM Journal on Computing, 38(6):2499-2510, 2009. Google Scholar
  14. Artur Czumaj and Christian Sohler. A characterization of graph properties testable for general planar graphs with one-sided error (It’s all about forbidden subgraphs). In Proceedings of the 60th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 1513-1536, 2019. Google Scholar
  15. Hossein Esfandiari, Mohammadtaghi Hajiaghayi, Vahid Liaghat, Morteza Monemizadeh, and Krzysztof Onak. Streaming algorithms for estimating the matching size in planar graphs and beyond. ACM Transactions on Algorithms, 14(4):48, 2018. Google Scholar
  16. Alireza Farhadi, Mohammad Taghi Hajiaghayi, Tung Mai, Anup Rao, and Ryan A. Rossi. Approximate maximum matching in random streams. In Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1773-1785, 2020. Google Scholar
  17. Hendrik Fichtenberger, Pan Peng, and Christian Sohler. Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty. In Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, pages 714-726, 2019. URL: https://doi.org/10.1137/1.9781611975482.45.
  18. Oded Goldreich. Introduction to Property Testing. Cambridge University Press, 2017. Google Scholar
  19. Oded Goldreich, Shafi Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, 1998. Google Scholar
  20. Oded Goldreich and Dana Ron. Property testing in bounded degree graphs. Algorithmica, 32:302-343, 2002. Google Scholar
  21. Oded Goldreich and Dana Ron. On proximity-oblivious testing. SIAM Journal on Computing, 40(2):534-566, 2011. Google Scholar
  22. Oded Goldreich and Luca Trevisan. Three theorems regarding testing graph properties. Random Structures & Algorithms, 23(1):23-57, 2003. Google Scholar
  23. Monika Rauch Henzinger, Prabhakar Raghavan, and Sridhar Rajagopalan. Computing on data streams. In Proceedings of the DIMACS Workshop on External Memory Algorithms, pages 107-118, 1998. Google Scholar
  24. Zengfeng Huang and Pan Peng. Dynamic graph stream algorithms in o(n) space. Algorithmica, 81(5):1965-1987, 2019. Google Scholar
  25. Kazuo Iwama and Yuichi Yoshida. Parameterized testability. ACM Transactions on Computation Theory, 9(4):16, 2018. Google Scholar
  26. Michael Kapralov, Sanjeev Khanna, and Madhu Sudan. Approximating matching size from random streams. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 734-751, 2014. Google Scholar
  27. Michael Kapralov, Slobodan Mitrović, Ashkan Norouzi-Fard, and Jakab Tardos. Space efficient approximation to maximum matching size from uniform edge samples. In Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1753-1772, 2020. Google Scholar
  28. Tali Kaufman, Michael Krivelevich, and Dana Ron. Tight bounds for testing bipartiteness in general graphs. SIAM Journal on Computing, 33(6):1441-1483, 2004. URL: https://doi.org/10.1137/S0097539703436424.
  29. Christian Konrad, Frédéric Magniez, and Claire Mathieu. Maximum matching in semi-streaming with few passes. In Proceedings of the 15th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 231-242, 2012. Google Scholar
  30. Mitsuru Kusumoto and Yuichi Yoshida. Testing forest-isomorphism in the adjacency list model. In Proceedings of the 37th International Colloquium on Automata, Languages, and Programming (ICALP), pages 763-774, 2014. Google Scholar
  31. Andrew McGregor. Graph stream algorithms: A survey. ACM SIGMOD Record, 43(1):9-20, 2014. Google Scholar
  32. Andrew McGregor and Sofya Vorotnikova. A simple, space-efficient, streaming algorithm for matchings in low arboricity graphs. In Proceedings of the 1st Symposium on Simplicity in Algorithms (SOSA), pages 14:1-14:4, 2018. URL: https://doi.org/10.4230/OASIcs.SOSA.2018.14.
  33. Morteza Monemizadeh, S. Muthukrishnan, Pan Peng, and Christian Sohler. Testable bounded degree graph properties are random order streamable. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP), pages 131:1-131:14, 2017. Google Scholar
  34. Shanmugavelayutham Muthukrishnan. Data streams: Algorithms and applications. Now Publishers Inc, 2005. Google Scholar
  35. Ilan Newman and Christian Sohler. Every property of hyperfinite graphs is testable. SIAM Journal on Computing, 42(3):1095-1112, 2013. Google Scholar
  36. Michal Parnas and Dana Ron. Testing the diameter of graphs. Random Structures & Algorithms, 20(2):165-183, 2002. URL: https://doi.org/10.1002/rsa.10013.
  37. Pan Peng and Christian Sohler. Estimating graph parameters from random order streams. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2449-2466, 2018. Google Scholar
  38. Sofya Raskhodnikova and Adam Smith. A note on adaptivity in testing properties of bounded degree graphs. Electronic Colloquium on Computational Complexity (ECCC), 13(089), 2006. Google Scholar
  39. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996. Google Scholar
  40. Xiaoming Sun and David P Woodruff. Tight bounds for graph problems in insertion streams. In Proceedings of the 18th International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 435-448, 2015. Google Scholar
  41. Yuichi Yoshida and Yusuke Kobayashi. Testing the (s,t)-disconnectivity of graphs and digraphs. Theoretical Computer Science, 434:98-113, 2012. 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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact