如何在人群中谨慎地传播谣言
How to Discreetly Spread a Rumor in a Crowd
摘要：
在本文中，我们研究了移动电话模型中的推-推式谣言传播算法，移动电话模型是经典电话模型的一种变体，其中每个节点每轮最多可以参与一个连接;即，你不能再让多个节点在一轮中从同一个来源获取信息。我们的模型还包括两个新的参数化推广：（1）网络拓扑可以经历有界的变化率（对于从每轮无变化到变化的参数化速率）;（2）在每一轮中，每个节点可以在做出连接决定之前向其所有邻居通告有限数量的信息（对于从无广告到大广告的参数化比特数）。我们证明，在移动电话模型中，没有广告，没有拓扑结构的变化，PUSH-PINGS风格的算法表现不佳，相对于一个图形的顶点扩展和图形电导相比，在经典的电话模型中的已知的紧的结果。然后，我们证明，但是，如果节点被允许在每一轮广告一个单一的位，自然变化的推送PURCH终止的时间相匹配（对数因子内）这一战略的性能在经典的电话模型-即使在存在频繁的拓扑结构变化。我们还分析了该算法的性能如何随着变化率的增加而降低。我们认为，我们的模型很好地匹配新兴的移动设备的对等通信标准的属性，我们的高效的PUSH-PIPE的变化，利用小广告和适应拓扑结构的变化是一个很好的选择，在这个日益重要的设置谣言传播。
英文摘要：
In this paper, we study PUSH-PULL style rumor spreading algorithms in the mobile telephone model, a variant of the classical telephone model in which each node can participate in at most one connection per round; i.e., you can no longer have multiple nodes pull information from the same source in a single round. Our model also includes two new parameterized generalizations: (1) the network topology can undergo a bounded rate of change (for a parameterized rate that spans from no changes to changes in every round); and (2) in each round, each node can advertise a bounded amount of information to all of its neighbors before connection decisions are made (for a parameterized number of bits that spans from no advertisement to large advertisements). We prove that in the mobile telephone model with no advertisements and no topology changes, PUSH-PULL style algorithms perform poorly with respect to a graph's vertex expansion and graph conductance as compared to the known tight results in the classical telephone model. We then prove, however, that if nodes are allowed to advertise a single bit in each round, a natural variation of PUSH-PULL terminates in time that matches (within logarithmic factors) this strategy's performance in the classical telephone model---even in the presence of frequent topology changes. We also analyze how the performance of this algorithm degrades as the rate of change increases toward the maximum possible amount. We argue that our model matches well the properties of emerging peer-to-peer communication standards for mobile devices, and that our efficient PUSH-PULL variation that leverages small advertisements and adapts well to topology changes is a good choice for rumor spreading in this increasingly important setting.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
