| 注册
首页|期刊导航|物理学报|一种新的复杂网络影响力最大化发现方法∗

一种新的复杂网络影响力最大化发现方法∗

胡庆成 张勇 许信辉 邢春晓 陈池 陈信欢

物理学报Issue(19):1-12,12.
物理学报Issue(19):1-12,12.DOI:10.7498/aps.64.190101

一种新的复杂网络影响力最大化发现方法∗

A new approach for influence maximization in complex networks

胡庆成 1张勇 1许信辉 1邢春晓 1陈池 1陈信欢1

作者信息

  • 1. 清华大学计算机科学与技术系,信息技术研究院,清华信息科学与技术国家实验室,北京 100084
  • 折叠

摘要

Abstract

Influence maximization modeling and analyzing is a critical issue in social network analysis in a complex network environment, and it can be significantly beneficial to both theory and real life. Given a fixed number k, how to find the set size k which has the greatest influencing scope is a combinatory optimization problem that has been proved to be NP-hard by Kempe et al. (2003). State-of-the-art random algorithm, although it is computation efficient, yields the worst performance;on the contrary, the well-studied greedy algorithms can achieve approximately optimal performance but its computing complexity is prohibitive for large social network; meanwhile, these algorithms should first acquire the global information (topology) of the network which is impractical for the colossal and forever changing network. We propose a new algorithm for influence maximization computing-RMDN and its improved version RMDN++. RMDN uses the information of a randomly chosen node and its nearest neighboring nodes which can avoid the procedure of knowing knowledge of the whole network. This can greatly accelerate the computing process, but its computing complexity is limited to the order of O(k log(n)). We use three different real-life datasets to test the effectiveness and efficiency of RMDN in IC model and LT model respectively. Result shows that RMDN has a comparable performance as the greedy algorithms, but obtains orders of magnitude faster according to different network; in the meantime, we have systematically and theoretically studied and proved the feasibility of our method. The wider applicability and stronger operability of RMDN may also shed light on the profound problem of influence maximization in social network.

关键词

复杂网络/影响力最大化/信息传播/贪心算法

Key words

complex network/influence maximization/information diffusion/greedy algorithm

引用本文复制引用

胡庆成,张勇,许信辉,邢春晓,陈池,陈信欢..一种新的复杂网络影响力最大化发现方法∗[J].物理学报,2015,(19):1-12,12.

基金项目

国家重点基础研究发展(973计划)(批准号:02011CB3023302)和国家高技术研究发展计划(863计划)(批准号:SS2015AA020102)资助的课题.@@@@* Project supported by the National Basic Research Program of China (Grant No.2011CB3023302) and the National High Technology Research and Development Program of China (Grant No. SS2015AA020102) (973计划)

物理学报

OA北大核心CSCDCSTPCD

1000-3290

访问量3
|
下载量0
段落导航相关论文