Identification of influencers in complex networks by local information dimensionality

August 29, 2019 Β· Declared Dead Β· πŸ› Information Sciences

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tao Wen, Yong Deng arXiv ID 1908.11298 Category cs.SI: Social & Info Networks Cross-listed physics.soc-ph Citations 112 Venue Information Sciences Last Checked 4 months ago
Abstract
The identification of influential spreaders in complex networks is a popular topic in studies of network characteristics. Many centrality measures have been proposed to address this problem, but most have limitations. In this paper, a method for identifying influencers in complex networks via the local information dimensionality. The proposed method considers the local structural properties around the central node; therefore, the scale of locality only increases to half of the maximum value of the shortest distance from the central node. Thus, the proposed method considers the quasilocal information and reduces the computational complexity. The information (number of nodes) in boxes is described via the Shannon entropy, which is more reasonable. A node is more influential when its local information dimensionality is higher. In order to show the effectiveness of the proposed method, five existing centrality measures are used as comparison methods to rank influential nodes in six real world complex networks. In addition, a susceptible infected (SI) model and Kendall's tau coefficient are applied to show the correlation between different methods. Experiment results show the superiority of the proposed method.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Social & Info Networks

Died the same way β€” πŸ‘» Ghosted