IDEAS home Printed from https://ideas.repec.org/a/eee/chsofr/v201y2025ip1s0960077925012627.html

Node clustering in complex networks based on the euclidean distance of structural characteristics

Author

Listed:
  • Feng, Deyue
  • Chen, Luyuan
  • Li, Meizhu
  • Zhang, Qi

Abstract

Node clustering is a technical method for community detection, which combines artificial intelligence clustering algorithms with the structural feature analysis of nodes in complex networks. It is widely used to reveal the underlying structure and functional organization of complex systems with networked structures. In this paper, a novel node clustering method based on the Euclidean distance of nodes’ structural features – specifically, closeness centrality and betweenness centrality – and the k-means++ algorithm is proposed. In this new method, node similarity is quantified by the Euclidean distance between their closeness and betweenness centralities, which incorporate both local and global structural information of the nodes. The clustering process is then performed using the k-means++ algorithm, which improves the initialization of cluster centers and enhances the stability and robustness of clustering results. Experimental results show that this approach effectively distinguishes central and peripheral nodes in networks with core–periphery structures and demonstrates strong adaptability to hierarchical topologies. Further analysis reveals that the clustering of nodes is robust, as the initial network topology has minimal impact on the final structure, while the growth rule plays a decisive role in the distribution of node categories. When the network evolves under the Erdős–Rényi mechanism, node clusters tend to be structurally homogeneous. In contrast, when the network’s growth is governed by the Barabási-Albert process, it leads to the emergence of peripheral-dominated clusters, a pattern that persists as the network size increases. Additionally, the method successfully uncovers the hierarchical structure of networks, as validated in real-world cases. Overall, the clustering method based on the Euclidean distance of structural features provides an innovative and effective tool for revealing structural properties within complex networks.

Suggested Citation

  • Feng, Deyue & Chen, Luyuan & Li, Meizhu & Zhang, Qi, 2025. "Node clustering in complex networks based on the euclidean distance of structural characteristics," Chaos, Solitons & Fractals, Elsevier, vol. 201(P1).
  • Handle: RePEc:eee:chsofr:v:201:y:2025:i:p1:s0960077925012627
    DOI: 10.1016/j.chaos.2025.117249
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0960077925012627
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.chaos.2025.117249?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li, Yongjian & Chen, Zhaoyang & Wu, Yuyuan & Gan, Yi & Lv, Qiuxia & Xiong, Qing, 2025. "Multiscale Weighted Motif Entropy based on Radius Constrained Arc-Limited Penetrable Visibility Graph: Concepts and applications," Chaos, Solitons & Fractals, Elsevier, vol. 200(P2).

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:201:y:2025:i:p1:s0960077925012627. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.