Robustness evaluation of multipartite complex networks based on percolation theory

To investigate the robustness of complex networks in face of disturbances can help prevent potential network disasters. Percolation on networks is a potent instrument for network robustness analysis. However, existing percolation theories are primarily developed for interdependent or multilayer netw...

Full description

Saved in:
Bibliographic Details
Main Authors: Cai, Qing, Alam, Sameer, Pratama, Mahardhika, Liu, Jiming
Other Authors: School of Mechanical and Aerospace Engineering
Format: Article
Language:English
Published: 2021
Subjects:
Online Access:https://hdl.handle.net/10356/147383
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:To investigate the robustness of complex networks in face of disturbances can help prevent potential network disasters. Percolation on networks is a potent instrument for network robustness analysis. However, existing percolation theories are primarily developed for interdependent or multilayer networks. Little attention is paid to multipartite networks which are an indispensable part of complex networks. In this article, we theoretically explore the robustness of multipartite networks under node failures. We put forward the generic percolation theory for gauging the robustness of multipartite networks with arbitrary degree distributions. Our developed theory is capable of quantifying the robustness of multipartite networks under either random or target node attacks. Our theory unravels the second order phase transition phenomenon for multipartite networks. In order to verify the correctness of the proposed theory, simulations on computer generated multipartite networks have been carried out. The experiments demonstrate that the simulation results coincide quite well with that yielded by the proposed theory.