Skip to content

A dynamic propagation-based algorithm for node diffusion capacity evaluation in complex networks

Aug 2026 · Cluster Computing · Vol 29 · 0 citations · 38 references

TL;DR

Experiments on both weighted and unweighted networks show that NDC outperforms 13 benchmark algorithms in terms of final infection ratio, propagation duration, and average infection rate, with statistical significance confirmed by t-tests.

View source

Similar papers

Conference Aug 2026

RIN: Resilient-Influential Node Detection in Complex Networks

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...

A. Kurudi̇rek, Ibrahim Filik, Sravan Sakhamuri et al. · 0 citations
Open access Sep 2026

KSGR: An Influential Node Identification Algorithm for Directed Networks Integrating Reverse Reachability and Structural Enhancement Mechanisms

The identification of influential nodes in directed networks is fundamental to diffusion analysis, network robustness assessment, and information recommendation. Owing to the asymmetry introduced by directed edges, conventional centrality methods often struggle to jointly characterize the local spreading range, higher-...

Zi-Yue Zhao, Bo Hu · 0 citations
Open access 2026

A Unified Weighted K-Shell Framework With Dynamic Decomposition for Influential Node Identification in Complex Networks

Identifying influential nodes in complex networks is a fundamental problem in network science, with applications in epidemic control, information diffusion, and rumor spreading. K-shell decomposition is widely used due to its global perspective and linear time complexity. However, most K-shell based approaches are desi...

Shima Esfandiari, S. M. Fakhrahmad, Mohsen Raji · 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
Aug 2026

Vertex-level diffusion scaling from resistance distance.

The analysis of random walks on networks often relies on global quantities that average over nodes, thereby masking local differences in diffusion speed. This study introduces a vertex-level quantity Hi, defined as the finite-window fitted scaling exponent of the mean squared resistance distance ⟨Ωi2(t)⟩∼Cit2Hi from a...

Chun-Xiao Nie · 0 citations
Conference Aug 2026

Modeling and Identifying Susceptible Edge Nodes in Echo Chamber Propagation in Highly Aggregated Social Networks

Echo chamber affection would block information diffusion and cut down the success rate of delivery. It is of high value to model and identify the user nodes which are the edges of community in social networks as well as the susceptible ones in cascade propagation, especially for the scenario conducting viral marketing...

Feng-Jing Yin, Ming-Yan Li · 0 citations

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