检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Gui-Qiong Xu Lei Meng Deng-Qin Tu Ping-Le Yang 徐桂琼;孟蕾;涂登琴;杨平乐(Department of Information Management,School of Management,Shanghai University,Shanghai 200444,China;Business School,University of Shanghai for Science and Technology,Shanghai 200093,China;School of Electrical and Information Engineering,Jiangsu University of Science and Technology Zhangjiagang 215600,China)
机构地区:[1]Department of Information Management,School of Management,Shanghai University,Shanghai 200444,China [2]Business School,University of Shanghai for Science and Technology,Shanghai 200093,China [3]School of Electrical and Information Engineering,Jiangsu University of Science and Technology Zhangjiagang 215600,China
出 处:《Chinese Physics B》2021年第8期566-574,共9页中国物理B(英文版)
基 金:Project supported by the National Natural Foundation of China(Grant No.11871328);the Shanghai Science and Technology Development Funds Soft Science Research Project(Grant No.21692109800).
摘 要:Identifying influential nodes in complex networks is one of the most significant and challenging issues,which may contribute to optimizing the network structure,controlling the process of epidemic spreading and accelerating information diffusion.The node importance ranking measures based on global information are not suitable for large-scale networks due to their high computational complexity.Moreover,they do not take into account the impact of network topology evolution over time,resulting in limitations in some applications.Based on local information of networks,a local clustering H-index(LCH)centrality measure is proposed,which considers neighborhood topology,the quantity and quality of neighbor nodes simultaneously.The proposed measure only needs the information of first-order and second-order neighbor nodes of networks,thus it has nearly linear time complexity and can be applicable to large-scale networks.In order to test the proposed measure,we adopt the susceptible-infected-recovered(SIR)and susceptible-infected(SI)models to simulate the spreading process.A series of experimental results on eight real-world networks illustrate that the proposed LCH can identify and rank influential nodes more accurately than several classical and state-of-the-art measures.
关 键 词:complex networks influential nodes local structure susceptible infected recovered model susceptible infected model
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229