Novel Node Centrality-Based Efficient Empirical Robustness Assessment for Directed Network. (21st November 2020)

• Record Type: Journal Article
• Authors: Deng, Xiaolong; Ding, Hao; Chen, Yong; Chen, Cai; Lv, Tiejun
• Other Names: Wu Jia Academic Editor.
• Is Part Of: Complexity. Volume 2020(2020)
• Publication Date: 2020-11-21
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2020/8715619
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : In recent years, while extensive researches on various networks properties have been proposed and accomplished, little has been proposed and done on network robustness and node vulnerability assessment under cascades in directed large-scale online community networks. In essential, an online directed social network is a group-centered and information spread-dominated online platform which is very different from the traditional undirected social network. Some further research studies have indicated that the online social network has high robustness to random removals of nodes but fails to the intentional attacks, particularly to those attacks based on node betweenness or node directed coefficient. To explore on the robustness of directed social network, in this article, we have proposed two novel node centralities of ITG (information transfer gain-based probability clustering coefficient) and I M p v (directed path-based node importance centrality). These two new centrality models are designed to capture this cascading effect in directed online social networks. Furthermore, we also propose a new and highly efficient computing method based on iterations for I M p v . Then, with the abundant experiments on the synthetic signed network and real-life networks derived from directed online social media and directed human mobile phone calling network, it has been proved that our ITG and I M p v based on directed social network robustness and node vulnerability assessment method is more accurate, efficient, and faster than several traditional centrality methods such as degree and betweenness. And we also have proposed the solid reasoning and proof process of iteration times k in computation of I M p v . To the best knowledge of us, our research has drawn some new light on the leading edge of robustness on the directed social network.