.png){kind=icon}
.png){kind=icon}
Return
Higher-order structure based node importance evaluation in directed networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ipm.2024.103948.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Evaluating the significance of objects with possible relevant information is a crucial topic in information science. Due to the fact that objects related to each other can often be described using complex networks, this topic also forms a fundamental theme in network science. Most traditional methods for characterizing the importance of nodes in complex networks only utilize the binary relationships between node pairs, neglecting the influence brought by higher-order structures. Considering the specific interaction modes between local nodes in the network, this paper associates the higher-order structural characteristics of the network with the importance of the nodes. It constructs an evaluation framework for the importance of nodes in directed networks based on higher-order structures. Experimental analysis on both artificial data and scientific citation data from the APS dataset has validated the effectiveness of the proposed algorithms. Compared with PageRank and eigenvector centrality, the proposed algorithms demonstrated higher accuracy, revealing the role of higher-order structures in node importance evaluation. Finally, a robustness analysis of several algorithms indicated that the proposed algorithms exhibited good robustness.
Keywords:
Higher-order structures
Feedforward loops
Nodes importance
Directed networks
Journal
I
IF:
6.9
Papers:
5.2K
Citations:
1.4W