arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.22702cs.DScs.CC
收藏

检验边分布的性质

Testing Properties of Edge Distributions

Massachusetts Institute of Technology(麻省理工学院)

Yumou Fei

AI总结:

本文研究了图边分布的概率分布检验问题,提出了测试二分图性、三角形自由性和平方自由性近紧界,揭示了其样本复杂度与图结构的关系。

摘要:

我们启动了对图边分布概率分布的检验研究,受与『边分布无关』图性质检验密切相关的问题启发。本文的主要结果是测试边分布的二分图性、三角形自由性和平方自由性的近紧界,其样本复杂度分别显示为Θ(n)、n^{4/3±o(1)}和n^{9/8±o(1)}。本文的技术核心在于证明平方自由性测试的上界证明,其中我们开发了基于某些生日悖论型引理的新技术,可能具有独立兴趣。我们将讨论我们的技术如何融入分布无关性质检验的一般框架中。我们还将讨论我们的结果如何与极值组合学中的Turán问题和子图移除引理概念上相连。

英文摘要:

We initiate the study of distribution testing for probability distributions over the edges of a graph, motivated by the closely related question of ``edge-distribution-free'' graph property testing. The main results of this paper are nearly-tight bounds on testing bipartiteness, triangle-freeness and square-freeness of edge distributions, whose sample complexities are shown to scale as $Θ(n)$, $n^{4/3\pm o(1)}$ and $n^{9/8\pm o(1)}$, respectively. The technical core of our paper lies in the proof of the upper bound for testing square-freeness, wherein we develop new techniques based on certain birthday-paradox-type lemmas that may be of independent interest. We will discuss how our techniques fit into the general framework of distribution-free property testing. We will also discuss how our results are conceptually connected with Turán problems and subgraph removal lemmas in extremal combinatorics.

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

↑