Hierarchy Theorems for Property Testing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Finding maximum degrees in hidden bipartite graphs
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Property testing
Hierarchy theorems for property testing
Property testing
Property testing
Hierarchy theorems for property testing
Property testing
Testing permutation properties through subpermutations
Theoretical Computer Science
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
Exact and approximate algorithms for the most connected vertex problem
ACM Transactions on Database Systems (TODS)
SIAM Journal on Discrete Mathematics
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
A graph property is called monotone if it is closed under removal of edges and vertices. Many monotone graph properties are some of the most well-studied properties in graph theory, and the abstract family of all monotone graph properties was also extensively studied. Our main result in this paper is that any monotone graph property can be tested with one-sided error, and with query complexity depending only on $\epsilon$. This result unifies several previous results in the area of property testing and also implies the testability of well-studied graph properties that were previously not known to be testable. At the heart of the proof is an application of a variant of Szemerédi's regularity lemma. The main ideas behind this application may be useful in characterizing all testable graph properties and in generally studying graph property testing. As a byproduct of our techniques we also obtain additional results in graph theory and property testing, which are of independent interest. One of these results is that the query complexity of testing testable graph properties with one-sided error may be arbitrarily large. Another result, which significantly extends previous results in extremal graph theory, is that for any monotone graph property ${\cal P}$, any graph that is $\epsilon$-far from satisfying ${\cal P}$ contains a subgraph of size depending on $\epsilon$ only, which does not satisfy ${\cal P}$. Finally, we prove the following compactness statement: If a graph $G$ is $\epsilon$-far from satisfying a (possibly infinite) set of monotone graph properties ${\cal P}$, then it is at least $\delta_{{\cal P}}(\epsilon)$-far from satisfying one of the properties.