Robustness and efficiency in interconnected networks with changes in network assortativity

In this study, the effect of assortativity on the robustness and efficiency of interconnected networks was investigated. This involved constructing a network that possessed the desired degree of assortativity. Additionally, an interconnected network was constructed wherein the assortativity between component networks possessed the desired value. With respect to single networks, the results indicated that a decrease in assortativity provided low hop length, high information diffusion efficiency, and distribution of communication load on edges. The study also revealed that excessive assortativity led to poor network performance. In the study, the assortativity between networks was defined and the following results were demonstrated: assortative connections between networks lowered the average hop length and enhanced information diffusion efficiency, whereas disassortative connections between networks distributed the communication loads of internetwork links and enhanced robustness. Furthermore, it is necessary to carefully adjust assortativity based on the node degree distribution of networks. Finally, the application of the results to the design of robust and efficient information networks was discussed.


Robustness and efficiency in interconnected networks with changes in network assortativity
Masaya Murakami, Shu Ishikura, Daichi Kominami, Tetsuya Shimokawa and Masayuki Murata
Applied Network Science 2017 2:6
DOI: 10.1007/s41109-017-0025-4