Abstract
We consider the question of whether adaptivity can improve the complexity of property testing algorithms in the dense graphs model. It is known that there can be at most a quadratic gap between adaptive and non-adaptive testers in this model, but it was not known whether any gap indeed exists. In this work we reveal such a gap.
Specifically, we focus on the well studied property of bipartiteness. Bogdanov and Trevisan (IEEE Symposium on Computational Complexity, pp. 75–81, 2004) proved a lower bound of Ω(1/ε 2) on the query complexity of non-adaptive testing algorithms for bipartiteness. This lower bound holds for graphs with maximum degree O(ε n). Our main result is an adaptive testing algorithm for bipartiteness of graphs with maximum degree O(ε n) whose query complexity is \(\tilde{O}(1/\epsilon ^{3/2})\) . A slightly modified version of our algorithm can be used to test the combined property of being bipartite and having maximum degree O(ε n). Thus we demonstrate that adaptive testers are stronger than non-adaptive testers in the dense graphs model.
We note that the upper bound we obtain is tight up-to polylogarithmic factors, in view of the Ω(1/ε 3/2) lower bound of Bogdanov and Trevisan for adaptive testers. In addition we show that \(\tilde{O}(1/\epsilon ^{3/2})\) queries also suffice when (almost) all vertices have degree \(\Omega(\sqrt{ \epsilon }\cdot n)\) . In this case adaptivity is not necessary.
Similar content being viewed by others
References
Alon, N.: Testing subgraphs of large graphs. Random Struct. Algorithms 21, 359–370 (2002)
Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica 20, 451–476 (2000)
Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: It’s all about regularity. In: Proc. 38th Symposium on the Theory of Computing (STOC) (2006)
Alon, N., Krivelevich, M.: Testing k-colorability. SIAM J. Discrete Math. 15, 211–227 (2002)
Alon, N., Shapira, A.: A characterization of easily testable induced subgraphs. Comb. Probab. Comput. 15, 791–805 (2005)
Alon, N., Shapira, A.: Every monotone graph property is testable. In: Proc. 37th Symposium on the Theory of Computing (STOC), pp. 129–137 (2005). To appear in SICOMP
Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (2000)
Ben-Sasson, E., Harsha, P., Raskhodnikova, S.: 3CNF properties are hard to test. SIAM J. Comput. 35(1), 1–21 (2005)
Bogdanov, A., Trevisan, L.: Lower bounds for testing bipartiteness in dense graphs. In: Proc. 19th IEEE Symp. Computational Complexity Conference, pp. 75–81 (2004)
Czumaj, A., Sohler, C.: Abstract combinatorial programs and efficient property testers. SIAM J. Comput. 34(3), 580–615 (2005)
Ergun, F., Kannan, S., Kumar, S.R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. J. Comput. Syst. Sci. 60(3), 717–751 (2000)
Fischer, E.: The art of uninformed decisions: A primer to property testing. Bull. Eur. Assoc. Theor. Comput. Sci. 75, 97–126 (2001)
Fischer, E.: On the strength of comparisons in property testing. Inf. Comput. 189, 107–116 (2004)
Fischer, E.: Testing graphs for colorability properties. Random Struct. Algorithms 26(3), 289–309 (2005)
Fischer, E., Newman, I.: Testing versus estimation of graph properties. SIAM J. Comput. 37(2), 482–501 (2007)
Goldreich, O.: Combinatorial property testing—a survey. In: Randomization Methods in Algorithm Design, pp. 45–60 (1998)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connections to learning and approximation. J. ACM 45, 653–750 (1998)
Goldreich, O., Ron, D.: A sublinear bipartite tester for bounded degree graphs. Combinatorica 19(3), 335–373 (1999)
Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica 32(2), 302–343 (2002)
Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. Random Struct. Algorithms 23(1), 23–57 (2003)
Janson, S.: Poisson approximation for large deviations. Random Struct. Algorithms 1(2), 221–229 (1990)
Kaufman, T., Krivelevich, M., Ron, D.: Tight bounds for testing bipartiteness in general graphs. SIAM J. Comput. 33(6), 1441–1483 (2004)
Raskhodnikova, S., Smith, A.: A note on adaptivity in testing properties of bounded degree graphs. Technical Report TR06-089, Electronic Colloquium on Computational Complexity (ECCC) (2006). Available from http://www.eccc.uni-trier.de/eccc/
Ron, D.: Property testing. In: Handbook on Randomization, vol. II, pp. 597–649 (2001)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the Israel Science Foundation (grant number 89/05).
Rights and permissions
About this article
Cite this article
Gonen, M., Ron, D. On the Benefits of Adaptivity in Property Testing of Dense Graphs. Algorithmica 58, 811–830 (2010). https://doi.org/10.1007/s00453-008-9237-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-008-9237-4