Abstract
Complex systems in the real world inevitably suffer from unpredictable perturbations, which can trigger system disasters, wreaking significant economical losses. To exploit the robustness of complex systems in the face of disturbances is of great significance. One of the most useful methods for system robustness analysis comes from the field of complex networks characterized by percolation theories. Many percolation theories, therefore, have been developed by researchers to investigate the robustness of diverse complex networks. Nevertheless, extant percolation theories are primarily devised for multilayer or interdependent networks. Little endeavor is dedicated to systems with multipartitivity structures, that is, multipartite networks, which are an indispensable part of complex networks. This paper fills this research gap by theoretically examining the robustness of multipartite networks under random or target node attacks. The generic percolation theory for robustness analysis of multipartite networks is accordingly put forward. To validate the correctness of the proposed percolation theory, we carry out simulations on computer-generated multipartite networks with Poisson degree distributions. The results yielded by the proposed theory coincide well with the simulations. Both theoretical and simulation results suggest that complex systems with multipartitivity structures could be more robust than those with multilayer structures.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.