Finding Robust and Influential Nodes from Networks under Cascading Failures Using a Memetic Algorithm

In the research of complex networks, how to find a set of nodes in the network with the most extensive range in the propagation process, i.e., the Influence Maximization (IM) problem, is one of the focal topics. Existing studies mainly consider the information dissemination process on networks and how to select diffusive nodes efficiently, but little attention has been paid to changes related to the network structure. In reality, networked systems are exposed to uncertain interferences and even destructive sabotages, and cascading failures are one common destruction that can cause networks to collapse even if only a small number of nodes fail. In the case of various complex environmental factors, how to select robust and influential nodes, i.e., the robust influence maximization (RIM) problem, is of great importance in promoting the realistic application of the influence maximization problem. This paper investigates the RIM problem under cascading failures to address the shortcomings in previous studies. Based on existing research, a new performance evaluation metric, RS-cf, is designed to assess the level of robust influence in a numerical form. For solving the seed determination problem, a Memetic algorithm towards the RIM problem under cascading failures, MA-RIMCF, is designed to find nodes with stable information propagation capability guided by RS-cf. Experiments have been conducted on both synthetic and realistic networks to validate the performance of the algorithm. Results indicate that MA-RIMCF can obtain competitive candidates over existing approaches, and seeds with robust and influential abilities are generated to solve diffusion dilemmas.