A New Method for Ranking the Most Influential Node in Complex Networks

DOI

10.2991/lemcs-15.2015.311How to use a DOI?

Keywords

Complex networks; Node influence; Node ranking; Information dissemination

Abstract

Currently, understanding the topology structure and function of complex networks has become a hot research topic, and finding the most influential node in a complex network has great significance in marketing, public opinion analysis, disease control and so on. We often use the degree centrality and some other centralities to measure the impact of the node, but they only reflect partial nature of the network. In order to describe the key nodes of the network more accurately, in this paper, we present a new method of ranking the most influential node in a complex network, which not only takes the degree centrality into consideration but also takes the position of the nodes in the network and the nodes’ important neighbors into account. Then we use the Independent Cascade Model for propagation simulation. Experiments show that the method we proposed could identify the most influential nodes more effectively. Compared with the traditional method it has better dissemination of results and lower time complexity.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhisong Wang
PY  - 2015/07
DA  - 2015/07
TI  - A New Method for Ranking the Most Influential Node in Complex Networks
BT  - Proceedings of the International Conference on Logistics, Engineering, Management and Computer Science
PB  - Atlantis Press
SP  - 1562
EP  - 1567
SN  - 1951-6851
UR  - https://doi.org/10.2991/lemcs-15.2015.311
DO  - 10.2991/lemcs-15.2015.311
ID  - Wang2015/07
ER  -