Testing versus estimation of graph properties, revisited

Abstract A graph on vertices is ‐far from property if one should add/delete at least edges to turn into a graph satisfying . A distance estimator for is an algorithm that given and distinguishes between the case that is ‐close to and the case that is ‐far from . If has a distance estimator whose query complexity depends only on , then is said to be estimable . Every estimable property is clearly also testable, since testing corresponds to estimating with . A central result in the area of property testing is the Fischer–Newman theorem, stating that an inverse statement also holds, that is, that every testable graph property is in fact estimable. The proof of Fischer and Newman was highly ineffective, since it incurred a tower‐type loss when transforming a testing algorithm for into a distance estimator. This raised the natural problem, studied recently by Fiat–Ron and by Hoppen–Kohayakawa–Lang–Lefmann–Stagni, whether one can find a transformation with a polynomial loss. We obtain the following results. We show that if 𝒫 is hereditary, then one can turn a tester for 𝒫 into a distance estimator with an exponential loss. This is an exponential improvement over the result of Hoppen et al., who obtained a transformation with a double exponential loss. We show that for every 𝒫 , one can turn a testing algorithm for 𝒫 into a distance estimator with a double exponential loss. This improves over the transformation of Fischer–Newman that incurred a tower‐type loss. Our main conceptual contribution in this work is that we manage to turn the approach of Fischer–Newman, which was inherently ineffective, into an efficient one. On the technical level, our main contribution is in establishing certain properties of Frieze–Kannan Weak Regular partitions that are of independent interest.