Just a Few Seeds More: Value of Network Information for Diffusion

ORG: Adoption Pub Date : 2018-04-01 DOI:10.2139/ssrn.3062830
M. Akbarpour, Suraj Malladi, A. Saberi
{"title":"Just a Few Seeds More: Value of Network Information for Diffusion","authors":"M. Akbarpour, Suraj Malladi, A. Saberi","doi":"10.2139/ssrn.3062830","DOIUrl":null,"url":null,"abstract":"Identifying the optimal set of individuals to first receive information ('seeds') in a social network is a widely-studied question in many settings, such as the diffusion of information, microfinance programs, and new technologies. Numerous studies have proposed various network-centrality based heuristics to choose seeds in a way that is likely to boost diffusion. Here we show that, for some frequently studied diffusion processes, randomly seeding s plus x individuals can prompt a larger cascade than optimally targeting the best s individuals, for a small x. We prove our results for large classes of random networks, but also show that they hold in simulations over several real-world networks. This suggests that the returns to collecting and analyzing network information to identify the optimal seeds may not be economically significant. Given these findings, practitioners interested in communicating a message to a large number of people may wish to compare the cost of network-based targeting to that of slightly expanding initial outreach.","PeriodicalId":159122,"journal":{"name":"ORG: Adoption","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"51","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ORG: Adoption","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3062830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 51

Abstract

Identifying the optimal set of individuals to first receive information ('seeds') in a social network is a widely-studied question in many settings, such as the diffusion of information, microfinance programs, and new technologies. Numerous studies have proposed various network-centrality based heuristics to choose seeds in a way that is likely to boost diffusion. Here we show that, for some frequently studied diffusion processes, randomly seeding s plus x individuals can prompt a larger cascade than optimally targeting the best s individuals, for a small x. We prove our results for large classes of random networks, but also show that they hold in simulations over several real-world networks. This suggests that the returns to collecting and analyzing network information to identify the optimal seeds may not be economically significant. Given these findings, practitioners interested in communicating a message to a large number of people may wish to compare the cost of network-based targeting to that of slightly expanding initial outreach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
再多几个种子:网络信息的传播价值
在社会网络中确定首先接收信息(“种子”)的最优个体集是一个在许多环境中被广泛研究的问题,例如信息扩散,小额信贷计划和新技术。许多研究提出了各种基于网络中心性的启发式方法,以一种可能促进传播的方式选择种子。在这里,我们表明,对于一些经常研究的扩散过程,随机播种s + x个体可以提示比最佳目标s个体更大的级联,对于较小的x。我们证明了大型随机网络的结果,但也表明它们在几个现实世界网络的模拟中是有效的。这表明,收集和分析网络信息以确定最优种子的回报可能不具有经济意义。鉴于这些发现,对向大量人群传播信息感兴趣的从业者可能希望将基于网络的目标定位的成本与略微扩大初始外展的成本进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Just a Few Seeds More: Value of Network Information for Diffusion The Spread of Innovations Through Social Learning
×
引用
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