arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.03519cs.DC
收藏

关于确定性多数过程的投票时间

On the Voting Time of the Deterministic Majority Process

Dominik Kaaser, Frederik Mallmann-Trenn, Emanuele Natale

摘要:

在确定性二元多数过程中,我们给出了一个简单的图,其中每个节点都有两个初始意见中的一个。在每一轮中,每个节点都采用其邻居中的多数意见。通过使用Goles和Olivos(1980)首先发现的一个潜在的论点,我们知道这个过程总是在$O(|E|)$轮中收敛到一个双周期状态,在这个状态中,每个节点要么保持它的意见,要么在每轮中改变它。Frischknecht,Keller,and Wattenhofer(2013)已经证明了确定性二元多数过程的收敛时间的$O(|E|)$界即使对于稠密图也确实是紧的。然而,在许多图中,如完全图,从任何初始意见分配,该过程收敛在一个常数轮数。通过仔细利用Goles和Olivos(1980)的势函数的结构,我们得到了一个新的确定性二元多数过程收敛时间的上界,该上界可以解释这种特殊情况。我们表明,它是可能的,以获得一个新的图形$G^Δ$的最坏情况下的收敛时间的性质,$G^Δ$是上界的$G$,以确定某些模块的图$G$。此外,即使我们的上限可以在线性时间内计算,我们表明,给定一个整数$k$,它是NP难决定是否存在一个初始的意见分配,它需要超过$k$轮收敛到两个周期的状态。

英文摘要:

In the deterministic binary majority process we are given a simple graph where each node has one out of two initial opinions. In every round, every node adopts the majority opinion among its neighbors. By using a potential argument first discovered by Goles and Olivos (1980), it is known that this process always converges in $O(|E|)$ rounds to a two-periodic state in which every node either keeps its opinion or changes it in every round. It has been shown by Frischknecht, Keller, and Wattenhofer (2013) that the $O(|E|)$ bound on the convergence time of the deterministic binary majority process is indeed tight even for dense graphs. However, in many graphs such as the complete graph, from any initial opinion assignment, the process converges in just a constant number of rounds. By carefully exploiting the structure of the potential function by Goles and Olivos (1980), we derive a new upper bound on the convergence time of the deterministic binary majority process that accounts for such exceptional cases. We show that it is possible to identify certain modules of a graph $G$ in order to obtain a new graph $G^Δ$ with the property that the worst-case convergence time of $G^Δ$ is an upper bound on that of $G$. Moreover, even though our upper bound can be computed in linear time, we show that, given an integer $k$, it is NP-hard to decide whether there exists an initial opinion assignment for which it takes more than $k$ rounds to converge to the two-periodic state.

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

↑