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

通信图中的相等性检验

Testing Equality in Communication Graphs

Noga Alon, Klim Efremenko, Benny Sudakov

摘要:

设$G=(V,E)$是具有$k$顶点的连通无向图.假设在图的每个顶点上都有一个玩家拥有一个$n$位串。每个参与者都可以根据商定的通信协议与其邻居进行通信,参与者必须确定性地决定他们的输入是否都相等。在解决这个问题的协议中,传输的最小可能比特总数是多少?在许多情况下,我们确定这个最小值为低阶加法项(但不是所有的图)。特别地,我们证明了对于任何Hamilton $k$ -顶点图,它都是$kn/2+o(n)$;对于任何$2$ -边连通图,如果$m$边中没有两个邻顶点的度超过$2$,它都是$mn/2+o(n)$ .证明结合图论的思想与工具,从加性数论。

英文摘要:

Let $G=(V,E)$ be a connected undirected graph with $k$ vertices. Suppose that on each vertex of the graph there is a player having an $n$-bit string. Each player is allowed to communicate with its neighbors according to an agreed communication protocol, and the players must decide, deterministically, if their inputs are all equal. What is the minimum possible total number of bits transmitted in a protocol solving this problem ? We determine this minimum up to a lower order additive term in many cases (but not for all graphs). In particular, we show that it is $kn/2+o(n)$ for any Hamiltonian $k$-vertex graph, and that for any $2$-edge connected graph with $m$ edges containing no two adjacent vertices of degree exceeding $2$ it is $mn/2+o(n)$. The proofs combine graph theoretic ideas with tools from additive number theory.

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

↑