New Random Walk Algorithm Based on Different Seed Nodes for Community Detection

Jiansheng Cai (), Wencong Li, Xiaodong Zhang and Jihui Wang
Additional contact information
Jiansheng Cai: School of Mathematics and Statistics, Weifang University, Dongfeng East Street, Weifang 261061, China
Wencong Li: School of Mathematical Sciences, Ocean University of China, Songling Road, Qingdao 266100, China
Xiaodong Zhang: School of Mathematical Sciences, MOE-LSC, SHL-MAC, Shanghai Jiao Tong University, Dongchuan Road, Shanghai 200240, China
Jihui Wang: School of Mathematical Sciences, University of Jinan, West Nanxinzhuang Road, Jinan 250022, China

Mathematics, 2024, vol. 12, issue 15, 1-21

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 ( M C ) 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.

Keywords: complex networks; community detection; random walk; seed nodes (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/15/2374/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/15/2374/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:15:p:2374-:d:1446203

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().