arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2105.04809cs.DS
收藏

用荫度$O(\sqrt{n})$检验图的一般模型中的三角自由度

Testing Triangle Freeness in the General Model in Graphs with Arboricity $O(\sqrt{n})$

Reut Levi

摘要:

研究了一般图模型下的三角形自由度检验问题。这个问题首先由Alon等人在一般图模型中研究(SIAM J. Discret. Math.2008),他提供了依赖于图的顶点数和平均度的下界和上界。仅当$d_{\rm max} = O(d)$和$\bar{d} \leq \sqrt{n}$或当$\bar{d} = Θ(1)$时,它们的边界是紧的,其中$d_{\rm max}$表示图的最大度,$\bar{d}$表示图的平均度。在本文中,我们提供的界限,依赖于荫度的图和平均度。正如Alon等人所述,我们的测试器的参数是顶点数$n$、边数$m$和邻近参数$ε$(图的荫度不是算法的参数)。我们的测试人员的查询复杂度是预期的$\tilde{O}(Γ/\bar{d} + Γ)\cdot poly(1/ε)$,其中$Γ$表示输入图的荫度(我们使用$\tilde{O}(\cdot)$来抑制$O(\log \log n)$因素)。我们表明,荫度$O(\sqrt{n})$的图的上界是紧在以下意义上。对于任何$Γ\in [s]$,其中$s= Θ(\sqrt{n})$,存在一族具有荫度$Γ$和平均度$\bar{d}$的图,使得需要$Ω(Γ/\bar{d} + Γ)$查询来测试这一族图上的三角形自由度。此外,这个下限适用于任何这样的$Γ$和一个大范围的可行的平均度。

英文摘要:

We study the problem of testing triangle freeness in the general graph model. This problem was first studied in the general graph model by Alon et al. (SIAM J. Discret. Math. 2008) who provided both lower bounds and upper bounds that depend on the number of vertices and the average degree of the graph. Their bounds are tight only when $d_{\rm max} = O(d)$ and $\bar{d} \leq \sqrt{n}$ or when $\bar{d} = Θ(1)$, where $d_{\rm max}$ denotes the maximum degree and $\bar{d}$ denotes the average degree of the graph. In this paper we provide bounds that depend on the arboricity of the graph and the average degree. As in Alon et al., the parameters of our tester is the number of vertices, $n$, the number of edges, $m$, and the proximity parameter $ε$ (the arboricity of the graph is not a parameter of the algorithm). The query complexity of our tester is $\tilde{O}(Γ/\bar{d} + Γ)\cdot poly(1/ε)$ on expectation, where $Γ$ denotes the arboricity of the input graph (we use $\tilde{O}(\cdot)$ to suppress $O(\log \log n)$ factors). We show that for graphs with arboricity $O(\sqrt{n})$ this upper bound is tight in the following sense. For any $Γ\in [s]$ where $s= Θ(\sqrt{n})$ there exists a family of graphs with arboricity $Γ$ and average degree $\bar{d}$ such that $Ω(Γ/\bar{d} + Γ)$ queries are required for testing triangle freeness on this family of graphs. Moreover, this lower bound holds for any such $Γ$ and for a large range of feasible average degrees.

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

↑