This is an early access version, the complete PDF, HTML, and XML versions will be available soon.
Open AccessArticle
New Random Walk Algorithm Based on Different Seed Nodes for Community Detection
by
Jiansheng Cai
Jiansheng Cai 1,*,†
,
Wencong Li
Wencong Li 2,†
,
Xiaodong Zhang
Xiaodong Zhang 3 and
Jihui Wang
Jihui Wang 4
1
School of Mathematics and Statistics, Weifang University, Dongfeng East Street, Weifang 261061, China
2
School of Mathematical Sciences, Ocean University of China, Songling Road, Qingdao 266100, China
3
School of Mathematical Sciences, MOE-LSC, SHL-MAC, Shanghai Jiao Tong University, Dongchuan Road, Shanghai 200240, China
4
School of Mathematical Sciences, University of Jinan, West Nanxinzhuang Road, Jinan 250022, China
*
Author to whom correspondence should be addressed.
†
These authors contributed equally to this work.
Mathematics 2024, 12(15), 2374; https://doi.org/10.3390/math12152374 (registering DOI)
Submission received: 4 July 2024
/
Revised: 26 July 2024
/
Accepted: 29 July 2024
/
Published: 30 July 2024
Abstract
A complex network is an abstract modeling of complex systems in the real world, which plays an important role in analyzing the function of complex systems. Community detection is an important tool for analyzing network structure. In this paper, we propose a new community detection algorithm (RWBS) based on different seed nodes which aims to understand the community structure of the network, which provides a new idea for the allocation of resources in the network. RWBS provides a new centrality metric () to calculate node importance, which calculates the ranking of nodes as seed nodes. Furthermore, two algorithms are proposed for determining seed nodes on networks with and without ground truth, respectively. We set the number of steps for the random walk to six according to the six degrees of separation theory to reduce the running time of the algorithm. Since some traditional community detection algorithms may detect smaller communities, e.g., two nodes become one community, this may make the resource allocation unreasonable. Therefore, modularity (Q) is chosen as the optimization function to combine communities, which can improve the quality of detected communities. Final experimental results on real-world and synthetic networks show that the RWBS algorithm can effectively detect communities.
Share and Cite
MDPI and ACS Style
Cai, J.; Li, W.; Zhang, X.; Wang, J.
New Random Walk Algorithm Based on Different Seed Nodes for Community Detection. Mathematics 2024, 12, 2374.
https://doi.org/10.3390/math12152374
AMA Style
Cai J, Li W, Zhang X, Wang J.
New Random Walk Algorithm Based on Different Seed Nodes for Community Detection. Mathematics. 2024; 12(15):2374.
https://doi.org/10.3390/math12152374
Chicago/Turabian Style
Cai, Jiansheng, Wencong Li, Xiaodong Zhang, and Jihui Wang.
2024. "New Random Walk Algorithm Based on Different Seed Nodes for Community Detection" Mathematics 12, no. 15: 2374.
https://doi.org/10.3390/math12152374
Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details
here.
Article Metrics
Article metric data becomes available approximately 24 hours after publication online.