Rumor Spreading and Conductance

Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, A. Panconesi
{"title":"Rumor Spreading and Conductance","authors":"Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, A. Panconesi","doi":"10.1145/3173043","DOIUrl":null,"url":null,"abstract":"In this article, we study the completion time of the PUSH-PULL variant of rumor spreading, also known as randomized broadcast. We show that if a network has n nodes and conductance φ then, with high probability, PUSH-PULL will deliver the message to all nodes in the graph within O(log n/φ) many communication rounds. This bound is best possible. We also give an alternative proof that the completion time of PUSH-PULL is bounded by a polynomial in log n/φ, based on graph sparsification. Although the resulting asymptotic bound is not optimal, this proof shows an interesting and, at the outset, unexpected connection between rumor spreading and graph sparsification. Finally, we show that if the degrees of the two endpoints of each edge in the network differ by at most a constant factor, then both PUSH and PULL alone attain the optimal completion time of O(log n/φ), with high probability.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"1 1","pages":"1 - 21"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the ACM (JACM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3173043","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

In this article, we study the completion time of the PUSH-PULL variant of rumor spreading, also known as randomized broadcast. We show that if a network has n nodes and conductance φ then, with high probability, PUSH-PULL will deliver the message to all nodes in the graph within O(log n/φ) many communication rounds. This bound is best possible. We also give an alternative proof that the completion time of PUSH-PULL is bounded by a polynomial in log n/φ, based on graph sparsification. Although the resulting asymptotic bound is not optimal, this proof shows an interesting and, at the outset, unexpected connection between rumor spreading and graph sparsification. Finally, we show that if the degrees of the two endpoints of each edge in the network differ by at most a constant factor, then both PUSH and PULL alone attain the optimal completion time of O(log n/φ), with high probability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
谣言的传播与行为
在本文中,我们研究了推拉式谣言传播的完成时间,也称为随机广播。我们证明了如果一个网络有n个节点,电导φ,那么推拉很有可能在O(log n/φ)多次通信回合内将消息传递给图中的所有节点。这个边界是最好的。在图稀疏化的基础上,给出了推拉完成时间被log n/φ多项式限定的另一种证明。虽然所得的渐近界不是最优的,但这个证明在谣言传播和图稀疏化之间显示了一个有趣的、意想不到的联系。最后,我们证明了如果网络中每条边的两个端点的度数相差不超过一个常数因子,那么单独PUSH和PULL都有高概率达到最优完成时间O(log n/φ)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound The Reachability Problem for Two-Dimensional Vector Addition Systems with States Invited Articles Foreword On Nonconvex Optimization for Machine Learning Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1