Robustness on topology reconfiguration of complex networks: An entropic approach

F. Safaei, H. Yeganloo and R. Akbar

Mathematics and Computers in Simulation (MATCOM), 2020, vol. 170, issue C, 379-409

Abstract: Study on complex networks illustrates systems of real-world in disparate realms that incorporates a range of biological networks to technological systems and has, over the past years, become one of the most important and fascinating fields of the interdisciplinary research center. These complex networks share many topological features such as the small-worldness, scale-freeness, the existence of motifs and graphlets and self-similarity. In most cases, complex and real-networks are very large, and the description and analysis of them in explicit form is often faced with difficulty. We manage to head off aforementioned troubles by examining successful models amongst communication networks in some particular aspects, including important factors such as cost, security, integrity, scalability, and fault tolerant. The last factor is distinctly important for each communication network. Recently, some methods and mechanisms have been proposed to increase and improve the robustness of network by modifying its topology. The rewiring is the mechanism amongst the defensive strategies to increase the resilience of attacked networks in which the affected nodes are disconnected from faulty nodes and, possibly, connect to another profitable node with a specific probability. In this paper, a rewiring mechanism based on Shannon entropy concept is proposed to streamline the complex networks configuration in order to improve their resiliency. Network entropy is a quantitative criterion for describing its robustness and is acknowledged as one of the topological characteristic criteria. In practice, this quantity is related to the capacity of the network to tolerate changes in its configuration under various environmental constraints. We evaluate the network robustness based on the spectrum of degree distribution, heterogeneity, as well as the average size of the largest connected cluster during removing nodes with a sequence of systematic attacks based on the degree, betweenness, and Dangalchev’s closeness centralities. The proposed rewiring strategy is applied over six synthetic networks and six real datasets, and then we verified that through approximately 30% swapping of links, the overall robustness of networks can be reached.

Keywords: Complex networks; Network robustness; Shannon’s entropy; Edge rewiring; Network optimization; Onion-like network (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475419303477
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:170:y:2020:i:c:p:379-409

DOI: 10.1016/j.matcom.2019.11.013

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().