Title: Non-cooperative game-based overlapping community detection algorithm

Authors: Yao Jiqiang; Deng Kun; Liu Xingyan

Addresses: College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua, Zhejiang Province, China; Key Laboratory of Medical Electronics and Digital Health of Zhejiang Province, Jiaxing University, Jiaxing, Zhejiang Province, China ' College of Information Science and Engineering, Jiaxing University, Jiaxing, Zhejiang Province, China ' College of Information Science and Engineering, Jiaxing University, Jiaxing, Zhejiang Province, China

Abstract: Owing to the drawbacks of current non-cooperative game-based community detection algorithms, which include excessive iteration and high randomness in the results, this paper proposes a non-cooperative game-based overlapping community detection algorithm. Firstly, the algorithm defines the node influence coefficient to identify low-influence nodes. These nodes are then modelled as players in a community game, where the game ends when a player cannot improve their utility by changing strategies. Finally, experimental results using artificial benchmark networks and real networks demonstrate that this algorithm outperforms other comparative algorithms. The algorithm achieves at least a 10% improvement in NMI and a 15% improvement in EQ compared to the other algorithms.

Keywords: complex networks; community detection; utility functions; game theory.

DOI: 10.1504/IJWMC.2025.147636

International Journal of Wireless and Mobile Computing, 2025 Vol.29 No.1, pp.9 - 18

Received: 09 Jan 2023
Accepted: 02 Sep 2023
Published online: 24 Jul 2025 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article