Skip to content
Open access

IdentifyingInfluential Nodes in Complex Networks Based on the Integration of Smallest-Cycle and Non-Smallest-Cycle Features

Aug 2026 · Entropy · Vol 28, pp. 880 · 0 citations · 57 references
Medicine

TL;DR

A hybrid centrality measure that integrates information from both smallest-cycle structures and non-smallest-cycle structures associated with each target node provides a more comprehensive characterization of a node’s role in complex networks.

Abstract

In complex network analysis, the identification of influential nodes is a fundamental issue, which is closely related to the structural robustness of the network and the dynamics of propagation processes. Current research primarily focuses on mesoscale features based on the smallest cycles or local features derived from star-shaped structures. However, the role of neighboring nodes that are connected to a given node but do not participate in its smallest cycles remains underexplored in network analysis. To address this issue, this paper proposes a hybrid centrality measure that integrates information from both smallest-cycle structures and non-smallest-cycle structures associated with each target node. The smallest-cycle structures considered in this method are identified only within the imposed local search range and do not necessarily correspond to the true smallest cycles in the full graph. Specifically, the extent of a node’s involvement in mesoscale structures is characterized by the number of the smallest cycles it participates in, while its local structural heterogeneity is represented by the number of neighboring nodes connected to it that do not belong to any smallest cycles. These two aspects are then unified into a single node importance metric through a weighted integration strategy. This paper evaluates node importance from multiple perspectives, including propagation capability analysis based on the SI model, network robustness testing through node attack simulations, and ranking accuracy assessment using Kendall correlation coefficient. The experimental results demonstrate that the proposed method achieves competitive or superior performance compared with the selected baseline methods under the experimental settings considered in this work. The findings indicate that integrating smallest-cycle and non-smallest-cycle features provides a more comprehensive characterization of a node’s role in complex networks. This study offers a novel perspective on the integration of multi-scale structural information in complex networks and presents an effective new approach for the identification of important nodes.

Read PDF

Similar papers

Open access Sep 2026

Identifying critical nodes in complex networks via semiclustering weighted leverage centrality

Identifying key nodes in complex networks is of great significance for optimizing information dissemination, containing epidemics, and analyzing network robustness. The use of clustering coefficients to identify key nodes is a current research focus; however, existing studies have not yet applied this approach to lever...

Rong-Rong Yin, M. Shen, En-You Zhu et al. · 0 citations
Review Open access Sep 2026

A Comprehensive Survey on Identifying Influential Nodes: From Structural Centrality-based to Learning-based Methods

Identifying influential nodes in complex networks is a fundamental challenge in network science. This problem involves measuring the influence of nodes and identifying those that exert the greatest impact on network dynamics and information dissemination. Existing approaches can be broadly divided into two categories:...

Amir Sheikhahmadi, L. Tafakori, M. Jalili · 0 citations
Preprint Aug 2026

Criticality and universality in network dismantling

The proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions, indicating that the physics of network dismantling is insensitive...

L. Cirigliano, Claudio Castellano, Minsuk Kim et al. · 0 citations
Preprint Sep 2026

Edge-based Katz centralities for spatio-temporal multiplex networks

Katz centrality is a well-established measure to identify and rank the most important nodes in complex networks by means of a linear system solve. Recent works have developed notions of Katz centrality for temporal, i.e., time-evolving networks. Their drawback is that small changes in the network structure may drastica...

Kai Bergermann, Francesco Gravili, V. Simoncini et al. · 0 citations
Open access Aug 2026

Contagion backbone of temporal higher-order networks

It is shown, for the Susceptible-Infectious threshold process on temporal higher-order networks derived from human face-to-face interactions, that the contribution of each hyperlink can be quantified by a contagion backbone, whose dependency on the diffusion parameters is demonstrated and supported by theoretical analy...

Shilun Zhang, A. Ceria, Hui-Juan Wang · 0 citations
Open access Sep 2026

A Key Node Ranking Method in Complex Networks by Integrating Semi-Local and Global Influence

The existing key node identification methods in complex networks rely on local topological information or global structural features, which are difficult to fully integrate multi-order local structural information and global propagation characteristics, resulting in the limitation of the accuracy and discrimination abi...

Xiao-Hu Chen, Xiao-Yang Liu, Jiao-Jiao Jiang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.