Improving the robustness of scale-free networks by maintaining community structure

2019 ◽  
Vol 7 (6) ◽  
pp. 838-864 ◽  
Author(s):  
Marzieh Mozafari ◽  
Mohammad Khansari

Abstract Scale-free networks, which play an important role in modelling human activities, are always suffering from intentional attacks which have serious consequences on their functionality. Degree distribution and community structure are two distinguishing characteristics of these networks considered in optimizing network robustness process recently. Since community structure is known as functional modules in some networks, modifying them during the improving network robustness process may affect network performance. We propose a preferential rewiring method to improve network robustness which not only keeps degree distribution unchanged but also preserves community structure and decreases the number of rewired edges at the same time. At first, the robustness of each community is improved by applying a smart rewiring method based on the neighbourhood of nodes. Then, relations between communities are gotten more robust with a preferential rewiring based on degree and betweenness hybrid centrality of nodes. This method was applied to several types of networks including Dolphins, WU-PowerGrid and US-Airline as real-world networks and Lancichinetti–Fortunato–Radicchi benchmark model as an artificial network with the scale-free property. The results show that the proposed method enhances the robustness of all networks against degree centrality attacks between 50% and 80% and betweenness centrality attacks between 30% and 70%. Whereas, in all cases, community structure preserved more than 50%. In comparison with previous studies, the proposed method can improve network robustness more significantly and decrease the number of rewires. It also is not dependent on the attack strategy.

2018 ◽  
Vol 18 (01) ◽  
pp. 1850001
Author(s):  
NAOKI TAKEUCHI ◽  
SATOSHI FUJITA

Scale-free networks have several favorable properties as the topology of interconnection networks such as the short diameter and the quick message propagation. In this paper, we propose a method to construct scale-free networks in a semi-deterministic manner. The proposed algorithm extends the Bulut's algorithm for constructing scale-free networks with designated minimum degree k and maximum degree m, in such a way that: (1) it determines the ideal number of edges derived from the ideal degree distribution; and (2) after connecting each new node to k existing nodes as in the Bulut’s algorithm, it adjusts the number of edges to the ideal value by conducting add/removal of edges. We prove that such an adjustment is always possible if the number of nodes in the network exceeds [Formula: see text]. The performance of the algorithm is experimentally evaluated.


2012 ◽  
Vol 99 (1) ◽  
pp. 10006 ◽  
Author(s):  
Han-Xin Yang ◽  
Zhi-Xi Wu ◽  
Wen-Bo Du

2021 ◽  
Vol 9 ◽  
Author(s):  
Zhaoxing Li ◽  
Qionghai Liu ◽  
Li Chen

A complex network can crash down due to disturbances which significantly reduce the network’s robustness. It is of great significance to study on how to improve the robustness of complex networks. In the literature, the network rewire mechanism is one of the most widely adopted methods to improve the robustness of a given network. Existing network rewire mechanism improves the robustness of a given network by re-connecting its nodes but keeping the total number of edges or by adding more edges to the given network. In this work we propose a novel yet efficient network rewire mechanism which is based on multiobjective optimization. The proposed rewire mechanism simultaneously optimizes two objective functions, i.e., maximizing network robustness and minimizing edge rewire operations. We further develop a multiobjective discrete partite swarm optimization algorithm to solve the proposed mechanism. Compared to existing network rewire mechanisms, the developed mechanism has two advantages. First, the proposed mechanism does not require specific constraints on the rewire mechanism to the studied network, which makes it more feasible for applications. Second, the proposed mechanism can suggest a set of network rewire choices each of which can improve the robustness of a given network, which makes it be more helpful for decision makings. To validate the effectiveness of the proposed mechanism, we carry out experiments on computer-generated Erdős–Rényi and scale-free networks, as well as real-world complex networks. The results demonstrate that for each tested network, the proposed multiobjective optimization based edge rewire mechanism can recommend a set of edge rewire solutions to improve its robustness.


2012 ◽  
Vol 20 (2) ◽  
pp. 301-319 ◽  
Author(s):  
Shade T. Shutters

Altruistic punishment occurs when an agent incurs a cost to punish another but receives no material benefit for doing so. Despite the seeming irrationality of such behavior, humans in laboratory settings routinely pay to punish others even in anonymous, one-shot settings. Costly punishment is ubiquitous among social organisms in general and is increasingly accepted as a mechanism for the evolution of cooperation. Yet if it is true that punishment explains cooperation, the evolution of altruistic punishment remains a mystery. In a series of computer simulations I give agents the ability to punish one another while playing a continuous prisoner's dilemma. In simulations without social structure, expected behavior evolves—agents do not punish and consequently no cooperation evolves. Likewise, in simulations with social structure but no ability to punish, no cooperation evolves. However, in simulations where agents are both embedded in a social structure and have the option to inflict costly punishment, cooperation evolves quite readily. This suggests a simple and broadly applicable explanation of cooperation for social organisms that have nonrandom social structure and a predisposition to punish one another. Results with scale-free networks further suggest that nodal degree distribution plays an important role in determining whether cooperation will evolve in a structured population.


2018 ◽  
Vol 21 ◽  
pp. 00012
Author(s):  
Andrzej Paszkiewicz

The paper concerns the use of the scale-free networks theory and the power law in designing wireless networks. An approach based on generating random networks as well as on the classic Barabási-Albert algorithm were presented. The paper presents a new approach taking the limited resources for wireless networks into account, such as available bandwidth. In addition, thanks to the introduction of opportunities for dynamic node removal it was possible to realign processes occurring in wireless networks. After introduction of these modifications, the obtained results were analyzed in terms of a power law and the degree distribution of each node.


2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
José H. H. Grisi-Filho ◽  
Raul Ossada ◽  
Fernando Ferreira ◽  
Marcos Amaku

We have analysed some structural properties of scale-free networks with the same degree distribution. Departing from a degree distribution obtained from the Barabási-Albert (BA) algorithm, networks were generated using four additional different algorithms (Molloy-Reed, Kalisky, and two new models named A and B) besides the BA algorithm itself. For each network, we have calculated the following structural measures: average degree of the nearest neighbours, central point dominance, clustering coefficient, the Pearson correlation coefficient, and global efficiency. We found that different networks with the same degree distribution may have distinct structural properties. In particular, model B generates decentralized networks with a larger number of components, a smaller giant component size, and a low global efficiency when compared to the other algorithms, especially compared to the centralized BA networks that have all vertices in a single component, with a medium to high global efficiency. The other three models generate networks with intermediate characteristics between B and BA models. A consequence of this finding is that the dynamics of different phenomena on these networks may differ considerably.


2011 ◽  
Vol 390 (21-22) ◽  
pp. 4027-4033 ◽  
Author(s):  
Yang Wang ◽  
Yanqing Hu ◽  
Zengru Di ◽  
Ying Fan

2007 ◽  
Vol 17 (07) ◽  
pp. 2447-2452 ◽  
Author(s):  
S. BOCCALETTI ◽  
D.-U. HWANG ◽  
V. LATORA

We introduce a fully nonhierarchical network growing mechanism, that furthermore does not impose explicit preferential attachment rules. The growing procedure produces a graph featuring power-law degree and clustering distributions, and manifesting slightly disassortative degree-degree correlations. The rigorous rate equations for the evolution of the degree distribution and for the conditional degree-degree probability are derived.


Sign in / Sign up

Export Citation Format

Share Document