Abstract

Critical nodes in temporal networks play more significant role than other nodes on the structure and function of networks. The research on identifying critical nodes in temporal networks has attracted much attention since the real-world systems can be illustrated more accurately by temporal networks than static networks. Considering the topological information of networks, the algorithm MLI based on network embedding and machine learning are proposed in this paper. we convert the critical node identification problem in temporal networks into regression problem by the algorithm. The effectiveness of proposed methods is evaluated by SIR model and compared with well-known existing metrics such as temporal versions of betweenness, closeness, k-shell, degree deviation and dynamics-sensitive centralities in one synthetic and five real temporal networks. Experimental results show that the proposed method outperform these well-known methods in identifying critical nodes under spreading dynamic.

Highlights

  • Critical nodes in temporal networks play more significant role than other nodes on the structure and function of networks

  • Liu et al.[22] proposed dynamic-sensitive centrality to measure the importance of nodes in static networks and temporal dynamic-sensitive c­ entrality[23] has advantage over the method proposed by Liu et al, which based on Markov chain for the epidemic model and derive the analytical result of node influence

  • The performance of MLI is evaluated by SIR spreading model, and compared with well-known existing metrics such as temporal versions of betweenness centrality, closeness centrality, k-shell, degree deviation centrality and dynamics-sensitive centrality in one synthetic and five real temporal networks

Read more

Summary

Introduction

Critical nodes in temporal networks play more significant role than other nodes on the structure and function of networks. The effectiveness of proposed methods is evaluated by SIR model and compared with well-known existing metrics such as temporal versions of betweenness, closeness, k-shell, degree deviation and dynamicssensitive centralities in one synthetic and five real temporal networks. The performance of proposed method is compared with that of temporal versions of betweenness centrality, closeness ­centrality[37], k-shell[38], degree deviation ­centrality[39] and dynamics-sensitive ­centrality[23] in SIR ­model[40,41] for one synthetic and five real temporal networks. The results show that the proposed method in this paper can effectively identify critical nodes which have greater impacts on information spreading in temporal networks

Methods
Results
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.