Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
Three theorems regarding testing graph properties
Random Structures & Algorithms
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences - STOC 2002
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Property testing in hypergraphs and the removal lemma
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On testable properties in bounded degree graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
What is the furthest graph from a hereditary property?
Random Structures & Algorithms
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Connections between probability estimation and graph theory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Spectral methods for matrices and tensors
Proceedings of the forty-second ACM symposium on Theory of computing
Parameter testing in bounded degree graphs of subexponential growth
Random Structures & Algorithms
Property testing and parameter testing for permutations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower bounds for testing triangle-freeness in Boolean functions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing expansion in bounded-degree graphs
Combinatorics, Probability and Computing
Property testing
Invariance in property testing
Property testing
Property testing
Invariance in property testing
Property testing
Testing permutation properties through subpermutations
Theoretical Computer Science
Every property of hyperfinite graphs is testable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Limits of kernel operators and the spectral regularity lemma
European Journal of Combinatorics
Characterizations of locally testable linear-and affine-invariant families
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On sums of locally testable affine invariant properties
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Limits on the rate of locally testable affine-invariant codes
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Inflatable graph properties and natural property tests
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Isomorphism of (mis)labeled graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
Characterizations of locally testable linear- and affine-invariant families
Theoretical Computer Science
Additive approximation for edge-deletion problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Testability of minimum balanced multiway cut densities
Discrete Applied Mathematics
Random Graphons and a Weak Positivstellensatz
Journal of Graph Theory
A note on permutation regularity
Discrete Applied Mathematics
Limits of permutation sequences
Journal of Combinatorial Theory Series B
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
An algebraic characterization of testable boolean CSPs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We define a distance of two graphs that reflects the closeness of both local and global properties. We also define convergence of a sequence of graphs, and show that a graph sequence is convergent if and only if it is Cauchy in this distance. Every convergent graph sequence has a limit in the form of a symmetric measurable function in two variables. We use these notions of distance and graph limits to give a general theory for parameter testing. As examples, we provide short proofs of the testability of MaxCut and the recent result of Alon and Shapira about the testability of hereditary graph properties.