Identifying influential nodes in social networks from the perspective of attack-defense game

Influence spread analysis, a critical component of social network studies, focuses on the patterns and effects of information dissemination among interconnected entities. The core of influence spread analysis is to identify influential nodes that involve two distinct aspects: influence maximization (IM) and influence blocking maximization (IBM). However, when IM and IBM occur simultaneously, identifying influential nodes becomes an intricate decision-making challenge. This study addresses identifying influential nodes in social networks through an attack-defense game perspective, where an attacker maximizes influence and a defender minimizes it. We first develop a two-player static zero-sum game model considering resource constraints. Based on the equilibrium strategy of this game, we redefine the concept of influential nodes from various viewpoints. Extensive experiments on synthetic and real-world networks show that, in most cases, the defender preferentially defends critical nodes, while the attacker adopts the decentralized strategy. Only when resources are unevenly matched do both players tend to adopt centralized strategies. This study expands the connotation of influential nodes and provides a novel paradigm for the social network analysis with significant potential applications.