We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the function values as edge probabilities. We give a characterization of properties testable this way, and extend a number of results about "large graphs" to this setting. These results can be applied to the original graph-theoretic property testing. In particular, we give a new combinatorial characterization of the testable graph properties. Furthermore, we define a class of graph properties (flexible properties) which contains all the hereditary properties, and generalize various results of Alon, Shapira, Fischer, Newman and Stav from hereditary to flexible properties. © 2010 Hebrew University Magnes Press.
CITATION STYLE
Lovász, Ĺ., & Szegedy, B. (2010). Testing properties of graphs and functions. Israel Journal of Mathematics, 178(1), 113–156. https://doi.org/10.1007/s11856-010-0060-7
Mendeley helps you to discover research relevant for your work.