An improvement method for degree and its extending centralities in directed networks

Peng Jia, Jiayong Liu, Cheng Huang, Lin Liu and Chunyang Xu

Physica A: Statistical Mechanics and its Applications, 2019, vol. 532, issue C

Abstract: Vital nodes identification in social networks keeps attracting lots of attention in recent years because of its great theoretical and practical significance for many applications. Degree centrality is one of the most efficient neighborhood-based metrics and has been widely used because of its simplicity and low computation complexity. Many other centralities derived from degree have been proposed to try to further improve the accuracy on ranking performance by extending the coverage area of neighbors. But a common problem of degree and its extensional centralities is that the directivity of edges between nodes is not considered. In directed network, nodes’ importance are not only related with their neighbor numbers but also related with the relationships between the nodes and their neighbors. In this paper, we propose a modification method with an adjustable parameter α on degree to improve its ranking accuracy in directed networks. This method redefines the degree of a node by separately taking into account its out-degree and in-degree and uses parameter α to flexibly set the relative weights between out-degree and in-degree when evaluating nodes’ importance in different scenes, which can effectively avoid the situation that too many neighbors from one direction could lead to extreme high value of centrality. We also apply this method on another two centralities: semi-local and k-hop, and for the two centralities that considering multi-step neighbors, the corresponding improvement centralities could eliminate the irrelevant multi-step neighbors when evaluating nodes’ importance. Experimental results in 3 real social networks and 1 artificial network indicate that, setting α to be appropriate value the improvement centralities can better estimate nodes’ connection abilities, propagation abilities and immunization abilities while keeping the same compute complexity with the corresponding original centralities, especially in the network with low percentage of bidirectional edges. Moreover, the improvement method proposed in this paper also can be applied to other centralities, such as eigenvector centrality, neighborhood centrality, Exdegree centrality and percolation based centrality, to improve their performances in directed networks.

Keywords: Complex networks; Improvement degree centrality; Vital nodes identification; Directed networks (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437119311148
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:532:y:2019:i:c:s0378437119311148

DOI: 10.1016/j.physa.2019.121891

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().