On Testability of First-Order Properties in Bounded-Degree Graphs

by   Isolde Adler, et al.

We study property testing of properties that are definable in first-order logic (FO) in the bounded-degree graph and relational structure models. We show that any FO property that is defined by a formula with quantifier prefix ∃^*∀^* is testable (i.e., testable with constant query complexity), while there exists an FO property that is expressible by a formula with quantifier prefix ∀^*∃^* that is not testable. In the dense graph model, a similar picture is long known (Alon, Fisher, Krivelevich, Szegedy, Combinatoria 2000), despite the very different nature of the two models. In particular, we obtain our lower bound by a first-order formula that defines a class of bounded-degree expanders, based on zig-zag products of graphs. We expect this to be of independent interest. We then prove testability of some first-order properties that speak about isomorphism types of neighbourhoods, including testability of 1-neighbourhood-freeness, and r-neighbourhood-freeness under a mild assumption on the degrees.



There are no comments yet.


page 1

page 2

page 3

page 4


On the Characterization of 1-sided error Strongly-Testable Graph Properties for bounded-degree graphs, including an appendix

We study property testing of (di)graph properties in bounded-degree grap...

VC density of set systems defnable in tree-like graphs

We study set systems definable in graphs using variants of logic with di...

Recursive Formula for Labeled Graph Enumeration

This manuscript presents a general recursive formula to estimate the siz...

Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty

One of the most fundamental questions in graph property testing is to ch...

GSF-locality is not sufficient for proximity-oblivious testing

In Property Testing, proximity-oblivious testers (POTs) form a class of ...

Efficiently learning Ising models on arbitrary graphs

We consider the problem of reconstructing the graph underlying an Ising ...

Modifying a Graph's Degree Sequence and the Testablity of Degree Sequence Properties

We show that if the degree sequence of a graph G is close in ℓ_1-distanc...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.