ﻻ يوجد ملخص باللغة العربية
Many real systems are extremely vulnerable against attacks, since they are scale-free networks as commonly existing topological structure in them. Thus, in order to improve the robustness of connectivity, several edge rewiring methods have been so far proposed by enhancing degree-degree correlations. In fact, onion-like structures with positive degree-degree correlations are optimally robust against attacks. On the other hand, recent studies suggest that the robustness and loops are strongly related to each other. Therefore, we focus on enhancing loops as a new approach for improving the robustness. In this work, we propose edge rewiring methods and evaluate the effect on the robustness by applying to real networks. Our proposed methods are two types of rewirings in preserving degrees or not for investigating the effect of the degree modification on the robustness. Numerical results show that our proposed methods improve the robustness to the level as same or more than the state-of-the-art methods. Furthermore, our work shows that the following two points are more important for further improving the robustness. First, the robustness is strongly related to loops more than degree-degree correlations. Second, it significantly improves the robustness by reducing the gap between the maximum and minimum degrees.
In a recent work [Proc. Natl. Acad. Sci. USA 108, 3838 (2011)], the authors proposed a simple measure for network robustness under malicious attacks on nodes. With a greedy algorithm, they found the optimal structure with respect to this quantity is
Many systems such as critical infrastructure exhibit a modular structure with many links within the modules and few links between them. One approach to increase the robustness of these systems is to reinforce a fraction of the nodes in each module, s
We study the robustness properties of multiplex networks consisting of multiple layers of distinct types of links, focusing on the role of correlations between degrees of a node in different layers. We use generating function formalism to address var
Online social networks (OSN) are prime examples of socio-technical systems in which individuals interact via a technical platform. OSN are very volatile because users enter and exit and frequently change their interactions. This makes the robustness
We numerically investigate that optimal robust onion-like networks can emerge even with the constraint of surface growth in supposing a spatially embedded transportation or communication system. To be onion-like, moderately long links are necessary i