Skip to content
Conference

RIN: Resilient-Influential Node Detection in Complex Networks

Aug 2026 · 2026 International Conference on Intelligent Multimedia, Networking, and Security (IMNS) · pp. 1-6 · 0 citations · 19 references

Abstract

Identifying influential nodes in complex networks is a fundamental problem with applications in information diffusion, epidemic control, infrastructure robustness, and biological systems. Traditional approaches rely on structural centrality measures, such as degree, betweenness, closeness, and PageRank, which quantify node importance based on network connectivity. However, these measures do not explicitly account for diffusion dynamics and the structural impact of node removal, where both spreading capability and network resilience play a critical role. In this paper, we propose a unified framework that jointly captures diffusion-based influence and structural resilience. We first introduce an SIR-based centrality in which node influence is defined by its spreading capability, while resilience is quantified by measuring the change in total network diffusion after node removal. To address the computational cost of this formulation, we propose the Resilient-Influential Node (RIN) centrality, which efficiently approximates the unified objective by combining classical centrality measures with a Laplacian-based structural adjustment. Experimental results on multiple real-world networks, using SIR-based rankings as ground truth, show that the proposed RIN framework provides a consistent and principled characterization of influential and resilient nodes across diverse network structures.

View source

Similar papers

Jul 2026

A Novel Gravity-Quasi-Laplacian Approach to Identifying Influential Nodes in Complex Networks

This study introduces a new ranking framework that integrates a quasi-Laplacian structural measure with a gravity-inspired aggregation process and demonstrates that the proposed framework consistently outperforms existing techniques in terms of accuracy, resolution, and computational simplicity.

Shima Esfandiari, S. M. Fakhrahmad · 0 citations
Aug 2026

K-Core Neighborhood Density: Mixing Local and Global Features for Influential Node Detection

Experimental results in seven complex networks of the real world show that the proposed hybrid centrality called k-core neighborhood density (KND) remarkably balances rank distribution and accuracy, and the identified influential nodes have a superior ability to spread their influence over a wide area of a network.

Sourav Kumar Mitra, Susanta Chakraborty, Malay Kule · 0 citations
Preprint Aug 2026

Spectral Efficiency Centrality: An Efficient Spectral Approach for Influential Node Identification in Temporal Networks

Spectral Efficiency Centrality (SEC), a temporal spectral centrality framework that quantifies node importance by evaluating the change in spectral radius caused by node removal across temporal snapshots, and ASEC, an efficient approximation based on Perron-Frobenius theory and first-order eigenvalue perturbation that...

Aksa Urooj, Iqra Altaf Gillani · 0 citations
Jul 2026

Steering dynamic network centrality via control theory

This work focuses on the problem of dynamic centrality, a measure of node importance in time-dependent networks, and addresses how to steer network centrality to a desired state by making minimal modifications to the network structure.

Fabio Durastante, Beatrice Meini, Luca Saluzzi · 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

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