拟随机谣言传播的实验分析
Quasirandom Rumor Spreading: An Experimental Analysis
摘要：
我们实证分析了两个版本的著名的“随机谣言传播”协议在网络中传播一条信息。在经典模型中，在每一轮中，每个被通知的节点通知随机邻居。在最近提出的quasirandom变体中，每个节点都有一个（循环）邻居列表。一旦被通知，它就从列表的随机位置开始，但从那时起，它就按照列表的顺序通知它的邻居。虽然稀疏随机图的quasirandom模型的更好的性能可以证明，所有其他的结果表明，独立的列表的结构，相同的渐近性能保证举行的经典模型。在这项工作中，我们比较了两个模型的实验。这不仅表明准随机模型通常更快，而且运行时间更集中在平均值附近。这是令人惊讶的，因为在准随机过程中使用了少得多的随机比特。在有损通信模型中也观察到这些优点，其中每个传输都不会以一定的概率到达其目标，并且在异步模型中，节点在从指数分布中提取的随机时间发送。我们还表明，通常的特定结构的列表上的效率几乎没有影响。
英文摘要：
We empirically analyze two versions of the well-known "randomized rumor spreading" protocol to disseminate a piece of information in networks. In the classical model, in each round each informed node informs a random neighbor. In the recently proposed quasirandom variant, each node has a (cyclic) list of its neighbors. Once informed, it starts at a random position of the list, but from then on informs its neighbors in the order of the list. While for sparse random graphs a better performance of the quasirandom model could be proven, all other results show that, independent of the structure of the lists, the same asymptotic performance guarantees hold as for the classical model. In this work, we compare the two models experimentally. This not only shows that the quasirandom model generally is faster, but also that the runtime is more concentrated around the mean. This is surprising given that much fewer random bits are used in the quasirandom process. These advantages are also observed in a lossy communication model, where each transmission does not reach its target with a certain probability, and in an asynchronous model, where nodes send at random times drawn from an exponential distribution. We also show that typically the particular structure of the lists has little influence on the efficiency.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
