arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.1982math.CO
收藏

确定性与非确定性图形属性测试

Deterministic vs Non-deterministic Graph Property Testing

Lior Gishboliner, Asaf Shapira

摘要:

一个图的性质P被称为可测试的,如果我们可以检查,如果一个图是接近或远离满足P使用几个随机局部检查。属性P被称为非确定性可测试的,如果一个人可以提供一个“证书”的事实,一个图满足P,以便一旦证书是给定的,其正确性可以测试。图属性的非确定性测试的概念最近由Lovasz和Vesztergombi引入,他们证明了(有点令人惊讶)一个图属性是可测试的,当且仅当它是非确定性可测试的。他们的证明使用了图极限,因此它没有提供任何明确的界限。因此,他们问,如果一个人可以得到一个证明他们的结果,这将提供这样的界限。我们回答他们的问题,积极证明他们的结果使用Szemeredi的正则引理。我们的证明的一个有趣的方面是,它突出了这样一个事实,即正则引理可以被解释为说,所有的图可以近似为许多“模板”图。

英文摘要:

A graph property P is said to be testable if one can check if a graph is close or far from satisfying P using few random local inspections. Property P is said to be non-deterministically testable if one can supply a "certificate" to the fact that a graph satisfies P so that once the certificate is given its correctness can be tested. The notion of non-deterministic testing of graph properties was recently introduced by Lovasz and Vesztergombi, who proved that (somewhat surprisingly) a graph property is testable if and only if it is non-deterministically testable. Their proof used graph limits, and so it did not supply any explicit bounds. They thus asked if one can obtain a proof of their result which will supply such bounds. We answer their question positively by proving their result using Szemeredi's regularity lemma. An interesting aspect of our proof is that it highlights the fact that the regularity lemma can be interpreted as saying that all graphs can be approximated by finitely many "template" graphs.

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

↑