三角形自由度检验的多方通信复杂性
On The Multiparty Communication Complexity of Testing Triangle-Freeness
摘要:
在本文中,我们发起的同时和非同时多方通信复杂性的性质测试的研究,侧重于测试图中的三角自由。我们考虑$\textit{coordinator}$模型,其中$k$参与者接收私有输入,而协调者不接收任何输入;协调者可以与所有参与者通信,但参与者不能相互通信。在这个模型中,我们问:如果输入图在参与者之间划分,每个参与者接收一些边,参与者和协调器需要交换多少位来确定图是无三角形的,还是无三角形的$\textit{far}$?对于一般的通信协议,我们表明,$\tilde{O}(k(nd)^{1/4}+k^2)$位是足够的,以测试三角形的自由度在图的大小$n$与平均度$d$(度不需要事先知道)。对于$\textit{simultaneous}$协议,只有一个通信回合,我们给出了一个协议,使用$\tilde{O}(k \sqrt{n})$位时$d = O(\sqrt{n})$和$\tilde{O}(k (nd)^{1/3})$时$d = Ω(\sqrt{n})$ ;这里,再次,平均程度$d$不需要事先知道。我们表明,平均度$d = O(1)$,我们的同时协议是渐近最优的对数因子。对于更高的程度,我们不能给出较低的边界上测试三角自由,但我们给出的证据表明,这个问题是很难找到一个边,参与三角形是很难的,即使承诺,至少一个常数部分的边缘必须删除,以使图形三角自由。
英文摘要:
In this paper we initiate the study of property testing in simultaneous and non-simultaneous multi-party communication complexity, focusing on testing triangle-freeness in graphs. We consider the $\textit{coordinator}$ model, where we have $k$ players receiving private inputs, and a coordinator who receives no input; the coordinator can communicate with all the players, but the players cannot communicate with each other. In this model, we ask: if an input graph is divided between the players, with each player receiving some of the edges, how many bits do the players and the coordinator need to exchange to determine if the graph is triangle-free, or $\textit{far}$ from triangle-free? For general communication protocols, we show that $\tilde{O}(k(nd)^{1/4}+k^2)$ bits are sufficient to test triangle-freeness in graphs of size $n$ with average degree $d$ (the degree need not be known in advance). For $\textit{simultaneous}$ protocols, where there is only one communication round, we give a protocol that uses $\tilde{O}(k \sqrt{n})$ bits when $d = O(\sqrt{n})$ and $\tilde{O}(k (nd)^{1/3})$ when $d = Ω(\sqrt{n})$; here, again, the average degree $d$ does not need to be known in advance. We show that for average degree $d = O(1)$, our simultaneous protocol is asymptotically optimal up to logarithmic factors. For higher degrees, we are not able to give lower bounds on testing triangle-freeness, but we give evidence that the problem is hard by showing that finding an edge that participates in a triangle is hard, even when promised that at least a constant fraction of the edges must be removed in order to make the graph triangle-free.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。