Percolation Theories for Multipartite Networked Systems under Random Failures

Abstract EN

Real-world complex systems inevitably suffer from perturbations.

When some system components break down and trigger cascading failures on a system, the system will be out of control.

In order to assess the tolerance of complex systems to perturbations, an effective way is to model a system as a network composed of nodes and edges and then carry out network robustness analysis.

Percolation theories have proven as one of the most effective ways for assessing the robustness of complex systems.

However, existing percolation theories are mainly for multilayer or interdependent networked systems, while little attention is paid to complex systems that are modeled as multipartite networks.

This paper fills this void by establishing the percolation theories for multipartite networked systems under random failures.

To achieve this goal, this paper first establishes two network models to describe how cascading failures propagate on multipartite networks subject to random node failures.

Afterward, this paper adopts the largest connected component concept to quantify the networks’ robustness.

Finally, this paper develops the corresponding percolation theories based on the developed network models.

Simulations on computer-generated multipartite networks demonstrate that the proposed percolation theories coincide quite well with the simulations.