A multi-factorial evolutionary algorithm concerning diversity information for solving the multitasking Robust Influence Maximization Problem on networks

Abstract

ABSTRACT In recent years, one of the prominent research areas in the complex network field has been the Influence Maximization Problem. This problem focuses on selecting seed sets to achieve optimal information propagation across networks. Practical networks often encounter challenges like node or link failures due to internal issues or external disturbances. Addressing this, researchers emphasize seed robustness against potential interferences, framing it as the robust influence maximisation problem. However, current approaches to this problem are incomplete, leaving several challenges unaddressed. On one hand, existing methods primarily handle seed selection under isolated disruptions, neglecting the simultaneous threats posed by both node-based and link-based attacks. On the other hand, prevailing algorithms fail to capture information synergy from multiple scenarios during the solution process. To bridge these gaps, this study integrates the multi-tasking optimisation theory into robust influence maximisation, introducing an evolutionary algorithm called DMFEA. DMFEA concurrently addresses multiple optimization scenarios, leveraging synergy between tasks while emphasizing information diversity. Experimental results demonstrate DMFEA's competitive edge over existing methods. This research significantly advances collaborative optimization for robust influence maximisation under multi-scenario disruptions, offering a reliable solution for robust information diffusion in complex environments.