作者其他论文
文献详情
Minimizing the expected complete influence time of a social network
文献类型:期刊
作者:Ni, Yaodong[1]  Xie, Lei[2]  Liu, Zhi-Qiang[3]  
机构:[1]Univ Int Business & Econ, Sch Informat Technol & Management, Beijing 100029, Peoples R China.;City Univ Hong Kong, Sch Creat Media, Hong Kong, Hong Kong, Peoples R China.;
[2]NW Polytech Univ, Sch Comp Sci, Xian 710072, Peoples R China.;
[3]City Univ Hong Kong, Sch Creat Media, Hong Kong, Hong Kong, Peoples R China.;
通讯作者:Ni, YD (reprint author), Univ Int Business & Econ, Sch Informat Technol & Management, Unit 1317,Boxue Bldg,10 Huixin Dongjie, Beijing 100029, Peoples R China.
年:2010
期刊名称:INFORMATION SCIENCES影响因子和分区
卷:180
期:13
页码范围:2514-2527
增刊:正刊
学科:计算机科学
收录情况:SCI(E)(WOS:000277850100002)  EI(20101612854972)  SSCI(WOS:000277850100002)  
所属部门:计算机学院
被引频次:12
人气指数:740
浏览次数:726
关键词:Social networks; Complete influence; Spanning forest; Stochastic simulation; Greedy algorithm
摘要:
Complete influence time specifies how long it takes to influence all individuals in a social network, which plays an important role in many real-life applications. In this paper, we study the problem of minimizing the expected complete influence time of social networks. We propose the incremental chance model to characterize the diffusion of influence, which is progressive and able to achieve complete influence. Theoretical properties of the expected complete influence time under the incremental ...More
0
评论(0 条评论)
登录