Minimizing the expected complete influence time of a social network

Yaodong Ni, Lei Xie, Zhi Qiang Liu

科研成果: 期刊稿件文章同行评审

32 引用 (Scopus)

摘要

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 chance model are presented. In order to trade off between optimality and complexity, we design a framework of greedy algorithms. Finally, we carry out experiments to show the effectiveness of the proposed algorithms.

源语言英语
页(从-至)2514-2527
页数14
期刊Information Sciences
180
13
DOI
出版状态已出版 - 1 7月 2010

指纹

探究 'Minimizing the expected complete influence time of a social network' 的科研主题。它们共同构成独一无二的指纹。

引用此