Eldar Fischer
ABSTRACT
The topic of tolerant property testing, that of distinguishing input instances that are far from satisfying a property from those that are close enough to satisfying it (as opposed to distinguishing the far instances only from the satisfying instances), has recently become an active topic of research in the field of combinatorial property testing [13]. In the general setting, there exist properties that are testable but not tolerantly testable [10]. However, we show here that in the setting of the dense graph model, all testable properties are not only tolerantly testable, but also admit a constant query size algorithm that estimates the distance from the property up to any fixed additive constant.In the course of the construction of this algorithm we develop a framework for extending Szemerédi's Regularity Lemma, both as a prerequisite for formulating what kind of information about the input graph will provide us with the correct estimation, and as the means for efficiently gathering this information. This work is also connected to the question of finding a combinatorial characterization of the testable graph properties, and to the question of efficiently finding a regular partition.
- N. Alon, R. A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the Regularity Lemma, Journal of Algorithms 16 (1994), 80--109. Google Scholar
Digital Library
- N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000), 451--476.Google ScholarCross Ref
- N. Alon and A. Shapira, Every monotone graph property is testable, to appear in this conference. Google ScholarDigital Library
- N. Alon and A. Shapira, private communication.Google Scholar
- M. Blum, M. Luby and R. Rubinfeld, Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences 47 (1993), 549--595 (a preliminary version appeared in Proc. 22nd STOC, 1990). Google ScholarDigital Library
- R. Diestel, Graph Theory (2nd edition), Springer (2000).Google Scholar
- E. Fischer, Testing graphs for colorability properties, Random Structures and Algorithms, to appear (a preliminary version appeared in Proc. 12th SODA, 2001). Google ScholarDigital Library
- E. Fischer, The art of uninformed decisions: A primer to property testing, The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97--126.Google Scholar
- E. Fischer, The difficulty of testing for isomorphism against a graph that is given in advance, SIAM Journal on Computing, to appear (a preliminary version appeared in Proc. 36th STOC, 2004). Google ScholarDigital Library
- E. Fischer and L. Fortnow, Tolerant versus intolerant testing for boolean properties, Proceedings of the 20th IEEE Conference on Computational Complexity (2005), to appear. Google ScholarDigital Library
- O. Goldreich, S. Goldwasser and D. Ron, Property testing and its connection to learning and approximation, Journal of the ACM 45 (1998), 653--750 (a preliminary version appeared in Proc. 37th FOCS, 1996). Google ScholarDigital Library
- O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, Random Structures and Algorithms 23 (2003), 23--57. Google ScholarDigital Library
- M. Parnas, D. Ron and R. Rubinfeld, Tolerant property testing and distance approximation, available as ECCC Report TR04-010.Google Scholar
- D. Ron, Property testing (a tutorial), In: Handbook of Randomized Computing (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim eds), Kluwer Press (2001).Google Scholar
- R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing 25 (1996), 252--271 (first appeared as a technical report, Cornell University, 1993). Google ScholarDigital Library
- E. Szemerédi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS No. 260 (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau eds.), 2978, 399--401.Google Scholar
Index Terms
- Testing versus estimation of graph properties
Recommendations
A combinatorial characterization of the testable graph properties: it's all about regularity
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingA common thread in recent results concerning the testing of dense graphs is the use of Szemerédi's regularity lemma. In this paper we show that in some sense this is not a coincidence. Our first result is that the property defined by having any given ...
Testing versus Estimation of Graph Properties
Tolerant testing is an emerging topic in the field of property testing, which was defined in [M. Parnas, D. Ron, and R. Rubinfeld, J. Comput. System Sci., 72 (2006), pp. 1012-1042] and has recently become a very active topic of research. In the general ...
Every monotone graph property is testable
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computingA graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many monotone graph properties are some of the most well-studied properties in ...
Comments