arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1905.09903math.COcs.DM
收藏

针对未知分布的测试图

Testing Graphs against an Unknown Distribution

Lior Gishboliner, Asaf Shapira

摘要:

图属性测试领域试图理解图的全局属性与其局部统计数据之间的关系。在经典模型中,图的局部统计量是相对于图的顶点集上的均匀分布来定义的。一个图的性质$\mathcal{P}$被称为是可测试的,如果一个图的局部统计可以允许一个人区分满足$\mathcal{P}$的图和那些远远不满足它的图。Goldreich最近介绍了这个模型的推广,其中一个人赋予输入图的顶点集一个任意的和未知的分布,并询问哪些可以在经典模型中测试的属性也可以在这个更一般的设置中测试。我们完全解决了这个问题,给一个(令人惊讶的“干净”)的特性,这些属性。为此,我们证明了一个删除引理的顶点加权图,这是独立的利益。

英文摘要:

The area of graph property testing seeks to understand the relation between the global properties of a graph and its local statistics. In the classical model, the local statistics of a graph is defined relative to a uniform distribution over the graph's vertex set. A graph property $\mathcal{P}$ is said to be testable if the local statistics of a graph can allow one to distinguish between graphs satisfying $\mathcal{P}$ and those that are far from satisfying it. Goldreich recently introduced a generalization of this model in which one endows the vertex set of the input graph with an arbitrary and unknown distribution, and asked which of the properties that can be tested in the classical model can also be tested in this more general setting. We completely resolve this problem by giving a (surprisingly "clean") characterization of these properties. To this end, we prove a removal lemma for vertex weighted graphs which is of independent interest.

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

↑