Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model

We study the relation between the query complexity of adaptive and non-adaptive testers in the dense graph model. It has been known for a couple of decades that the query complexity of non-adaptive testers is at most quadratic in the query complexity of adaptive testers. We show that this general result is essentially tight; that is, there exist graph properties for which any non-adaptive tester must have query complexity that is almost quadratic in the query complexity of the best general (i.e., adaptive) tester. More generally, for every q : N → N such that q(n) ≤ √ n and constant c ∈ [1, 2], we show a graph property that is testable in Θ(q(n)) queries, but its non-adaptive query complexity is Θ(q(n)), omitting poly(log n) factors and ignoring the effect of the proximity parameter . Furthermore, the upper bounds hold for one-sided error testers, and are at most quadratic in 1/ . These results are obtained through the use of general reductions that transport properties of ordered structured (like bit strings) to those of unordered structures (like unlabeled graphs). The main features of these reductions are query-efficiency and preservation of distance to the properties. This method was initiated in our prior work (ECCC, TR20-149), and we significantly extend it here. ∗Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Rehovot, Israel. E-mail: oded.goldreich@weizmann.ac.il. Partially supported by the Israel Science Foundation (grant No. 1041/18). †School of Mathematics, Institute for Advanced Study, Princeton, NJ 08540, USA. E-mail: avi@ias.edu. Research partially supported by NSF grant CCF-1900460. ISSN 1433-8092 Electronic Colloquium on Computational Complexity, Report No. 160 (2020)

[1]  Oded Goldreich,et al.  Introduction to Property Testing , 2017 .

[2]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[3]  Dana Ron,et al.  On the Benefits of Adaptivity in Property Testing of Dense Graphs , 2010, Algorithmica.

[4]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[5]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[6]  Oded Goldreich,et al.  Hierarchy Theorems for Property Testing , 2011, computational complexity.

[7]  Oded Goldreich On Testing Asymmetry in the Bounded Degree Graph Model , 2020, Electron. Colloquium Comput. Complex..

[8]  Eshan Chattopadhyay A Recipe for Constructing Two-Source Extractors∗ , 2020 .

[9]  Avi Wigderson,et al.  Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing , 2020, Electron. Colloquium Comput. Complex..

[10]  Sofya Raskhodnikova,et al.  A Note on Adaptivity in Testing Properties of Bounded Degree Graphs , 2006, Electron. Colloquium Comput. Complex..

[11]  Eli Ben-Sasson,et al.  3CNF Properties are Hard to Test , 2003, Electron. Colloquium Comput. Complex..

[12]  Ronen Shaltiel,et al.  An Introduction to Randomness Extractors , 2011, ICALP.

[13]  Dana Ron,et al.  Algorithmic Aspects of Property Testing in the Dense Graphs Model , 2009, Electron. Colloquium Comput. Complex..

[14]  Benny Sudakov,et al.  On the asymmetry of random regular graphs and random graphs , 2002, Random Struct. Algorithms.

[15]  Eldar Fischer On the strength of comparisons in property testing , 2004, Inf. Comput..