Information and Influence Propagation in Social Networks

Wei Chen, L. Lakshmanan, Carlos Castillo
{"title":"Information and Influence Propagation in Social Networks","authors":"Wei Chen, L. Lakshmanan, Carlos Castillo","doi":"10.2200/S00527ED1V01Y201308DTM037","DOIUrl":null,"url":null,"abstract":"Research on social networks has exploded over the last decade. To a large extent, this has been fueled by the spectacular growth of social media and online social networking sites, which continue growing at a very fast pace, as well as by the increasing availability of very large social network datasets for purposes of research. A rich body of this research has been devoted to the analysis of the propagation of information, influence, innovations, infections, practices and customs through networks. Can we build models to explain the way these propagations occur? How can we validate our models against any available real datasets consisting of a social network and propagation traces that occurred in the past? These are just some questions studied by researchers in this area. Information propagation models find applications in viral marketing, outbreak detection, finding key blog posts to read in order to catch important stories, finding leaders or trendsetters, information feed ranking, etc. A number of algorithmic problems arising in these applications have been abstracted and studied extensively by researchers under the garb of influence maximization. This book starts with a detailed description of well-established diffusion models, including the independent cascade model and the linear threshold model, that have been successful at explaining propagation phenomena. We describe their properties as well as numerous extensions to them, introducing aspects such as competition, budget, and time-criticality, among many others. We delve deep into the key problem of influence maximization, which selects key individuals to activate in order to influence a large fraction of a network. Influence maximization in classic diffusion models including both the independent cascade and the linear threshold models is computationally intractable, more precisely #P-hard, and we describe several approximation algorithms and scalable heuristics that have been proposed in the literature. Finally, we also deal with key issues that need to be tackled in order to turn this research into practice, such as learning the strength with which individuals in a network influence each other, as well as the practical aspects of this research including the availability of datasets and software tools for facilitating research. We conclude with a discussion of various research problems that remain open, both from a technical perspective and from the viewpoint of transferring the results of research into industry strength applications. Table of Contents: Acknowledgments / Introduction / Stochastic Diffusion Models / Influence Maximization / Extensions to Diffusion Modeling and Influence Maximization / Learning Propagation Models / Data and Software for Information/Influence: Propagation Research / Conclusion and Challenges / Bibliography / Authors' Biographies / Index","PeriodicalId":385440,"journal":{"name":"Information and Influence Propagation in Social Networks","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"389","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Influence Propagation in Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2200/S00527ED1V01Y201308DTM037","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 389

Abstract

Research on social networks has exploded over the last decade. To a large extent, this has been fueled by the spectacular growth of social media and online social networking sites, which continue growing at a very fast pace, as well as by the increasing availability of very large social network datasets for purposes of research. A rich body of this research has been devoted to the analysis of the propagation of information, influence, innovations, infections, practices and customs through networks. Can we build models to explain the way these propagations occur? How can we validate our models against any available real datasets consisting of a social network and propagation traces that occurred in the past? These are just some questions studied by researchers in this area. Information propagation models find applications in viral marketing, outbreak detection, finding key blog posts to read in order to catch important stories, finding leaders or trendsetters, information feed ranking, etc. A number of algorithmic problems arising in these applications have been abstracted and studied extensively by researchers under the garb of influence maximization. This book starts with a detailed description of well-established diffusion models, including the independent cascade model and the linear threshold model, that have been successful at explaining propagation phenomena. We describe their properties as well as numerous extensions to them, introducing aspects such as competition, budget, and time-criticality, among many others. We delve deep into the key problem of influence maximization, which selects key individuals to activate in order to influence a large fraction of a network. Influence maximization in classic diffusion models including both the independent cascade and the linear threshold models is computationally intractable, more precisely #P-hard, and we describe several approximation algorithms and scalable heuristics that have been proposed in the literature. Finally, we also deal with key issues that need to be tackled in order to turn this research into practice, such as learning the strength with which individuals in a network influence each other, as well as the practical aspects of this research including the availability of datasets and software tools for facilitating research. We conclude with a discussion of various research problems that remain open, both from a technical perspective and from the viewpoint of transferring the results of research into industry strength applications. Table of Contents: Acknowledgments / Introduction / Stochastic Diffusion Models / Influence Maximization / Extensions to Diffusion Modeling and Influence Maximization / Learning Propagation Models / Data and Software for Information/Influence: Propagation Research / Conclusion and Challenges / Bibliography / Authors' Biographies / Index
社交网络中的信息与影响传播
在过去的十年里,对社交网络的研究呈爆炸式增长。在很大程度上,这是由社交媒体和在线社交网站的惊人增长所推动的,它们继续以非常快的速度增长,以及用于研究目的的非常大的社交网络数据集的日益可用性。这方面的大量研究致力于分析通过网络传播的信息、影响、创新、感染、实践和习俗。我们能否建立模型来解释这些传播发生的方式?我们如何根据任何可用的真实数据集来验证我们的模型,这些数据集由社会网络和过去发生的传播痕迹组成?这些只是该领域研究人员研究的一些问题。信息传播模型在病毒式营销、爆发检测、寻找关键博客文章以捕捉重要故事、寻找领导者或趋势引领者、信息源排名等方面都有应用。在这些应用中出现的许多算法问题已经被研究人员在影响最大化的外衣下进行了广泛的抽象和研究。本书首先详细描述了成熟的扩散模型,包括独立级联模型和线性阈值模型,这些模型已经成功地解释了传播现象。我们描述了它们的属性以及对它们的许多扩展,介绍了竞争、预算和时间临界性等方面。我们深入研究了影响最大化的关键问题,即选择关键个体来激活,以影响网络的大部分。经典扩散模型(包括独立级联模型和线性阈值模型)中的影响最大化在计算上是难以处理的,更准确地说是#P-hard,我们描述了文献中提出的几种近似算法和可扩展的启发式算法。最后,我们还处理了需要解决的关键问题,以便将这项研究转化为实践,例如了解网络中个体相互影响的力量,以及本研究的实践方面,包括促进研究的数据集和软件工具的可用性。最后,我们从技术角度和将研究成果转化为行业优势应用的角度,讨论了各种尚未解决的研究问题。目录表:致谢/引言/随机扩散模型/影响最大化/扩散建模和影响最大化的扩展/学习传播模型/信息数据和软件/影响:传播研究/结论和挑战/参考书目/作者传记/索引
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信