arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.08490cs.CCcs.DMcs.DScs.LO
收藏

GSF局部性不足以进行邻近不经意测试

GSF-locality is not sufficient for proximity-oblivious testing

Isolde Adler, Noleen Köhler, Pan Peng

摘要:

在属性测试中,邻近不经意测试器(POT)形成了一类特别简单的测试算法,其中基本测试被执行多次,这可能取决于邻近参数,但是基本测试本身与邻近参数无关。在他们的开创性工作中,Goldreich和Ron [STOC 2009; SICOMP 2011]表明,允许在有界度模型中进行常量查询邻近不经意测试的图形属性正是可以表示为满足非传播条件的广义子图自由度(GSF)属性的属性。它是左开放的非传播条件是否是必要的。事实上,调用属性可表示为广义子图自由度属性GSF局部属性,他们问是否所有GSF局部属性是非传播的。我们给出了一个否定的答案,表现出的性质,是GSF-本地和传播的图。因此,特别是,我们的财产不承认一个POT,尽管是GSF本地。我们通过利用作者最近的一项工作来证明我们的结果,该工作构建了一个不可测试的一阶(FO)属性[SODA 2021],以及FO属性和GSF局部属性之间通过邻域配置文件的新联系。

英文摘要:

In Property Testing, proximity-oblivious testers (POTs) form a class of particularly simple testing algorithms, where a basic test is performed a number of times that may depend on the proximity parameter, but the basic test itself is independent of the proximity parameter. In their seminal work, Goldreich and Ron [STOC 2009; SICOMP 2011] show that the graph properties that allow constant-query proximity-oblivious testing in the bounded-degree model are precisely the properties that can be expressed as a generalised subgraph freeness (GSF) property that satisfies the non-propagation condition. It is left open whether the non-propagation condition is necessary. Indeed, calling properties expressible as a generalised subgraph freeness property GSF-local properties, they ask whether all GSF-local properties are non-propagating. We give a negative answer by exhibiting a property of graphs that is GSF-local and propagating. Hence in particular, our property does not admit a POT, despite being GSF-local. We prove our result by exploiting a recent work of the authors which constructed a first-order (FO) property that is not testable [SODA 2021], and a new connection between FO properties and GSF-local properties via neighbourhood profiles.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑