Community Search Based on Containment Control of Multi-Agent System with Opinion Leaders

Community search is the problem of identifying the community in which a given node resides. Different from traditional community search methods based on specific topological structures, this paper proposes a community search algorithm based on containment control of multi-agent system by studying the influence of opinion leaders with competitive relationships in community formation. Firstly, the Breadth-First Search method is used to locally sample the network. Secondly, containment control of multi-agent system is applied to obtain the final state of each node for local community partitioning. Finally, grounded in practical considerations, an effective leadership transfer mechanism is proposed to update the results and enhance search precision. Through experiments on real-world networks and synthetic networks in comparison with three local community detection algorithms, the effectiveness and rationality of our algorithm are demonstrated.