Skip to content
Preprint

Comparing Probabilistic Influence-Spreading Centralities to Commonly-Used Centrality Measures in Directed and Weighted Networks

Aug 2026 · 0 citations · 38 references
Computer Science

TL;DR

Comparing the ISM centrality measures to commonly used weighted variants of out-degree, in-degree, closeness, shortest-path betweenness, and Katz centrality in directed, weighted networks shows strong correlations between the ISM out-centrality and weighted out-degree and outward Katz centrality, particularly for low edge probabilities.

Abstract

The Influence-Spreading Model (ISM) introduces three probabilistic centrality measures: out-centrality, in-centrality, and ISM betweenness centrality. Out-centrality measures the average probability that a node influences others, while in-centrality measures the average probability that others influence a node. ISM betweenness centrality measures the change in total probabilistic influence when a node is removed. These measures depend on edge transmission probabilities and allow walks up to a specified maximum length. We compare the ISM centrality measures to commonly used weighted variants of out-degree, in-degree, closeness, shortest-path betweenness, and Katz centrality in directed, weighted networks using four real-world online social networks and nine synthetic networks generated by Erd\H{o}s-R\'enyi, navigable small-world, and directed scale-free models. For the synthetic networks, the edge probabilities are drawn from three beta distributions. We evaluate the similarity in centrality values and their ranking using Pearson correlation and Spearman's rank correlation coefficients. Results show strong correlations between the ISM out-centrality and weighted out-degree and outward Katz centrality, particularly for low edge probabilities. Conversely, relationships between the ISM in-centrality and other measures vary with network topology, sometimes yielding negative correlations. Correlations between the ISM betweenness and the shortest-path betweenness are also topology-dependent and weaken as alternative influence paths become more relevant. Overall, standard centrality measures can approximate the influence of broadcasting influence but often miss the nuances of receiving influence and probabilistic intermediary roles.

View source

Similar papers

Review Aug 2026

Centrality Measures in Temporal Networks: A Critical and Comparative Survey

Temporal networks offer a suitable representation for complex systems in which interactions vary over time, such as communication, transportation, and social networks. Identifying influential nodes in such networks is more challenging than in static graphs because node importance depends not only on network structure b...

Aksa Urooj, Iqra Altaf Gillani · 0 citations
Preprint Aug 2026

Degree Centrality Algorithms for Weighted Multilayer Networks (or w-MLNs)

Experimental results on both synthetic and real-world HoMLN datasets demonstrate that the heuristics achieve accuracy comparable to the ground truth while significantly improving computational efficiency, thereby establishing the scalability and effectiveness of the HoMLN algorithms developed using the decoupling appro...

A. Ayowole-Obi, Abhishek Santra, Sharma Chakravarthy · 0 citations

IDENTIFYING INFLUENTIAL NODES IN DIRECTED WEIGHTED NETWORKS USING PYTHAGOREAN FUZZY SETS

A new centrality metric called Node Pack Fuzzy Information Centrality (NPFIC), which suggests that crucial information about a node's significance can be derived from the internal structure of its pack and is compared with four established centrality measures.

Venkata Rao Songa, DR. Prajna Bodapati · 0 citations
Preprint Sep 2026

Link prediction in complex networks via fusing node centrality and local similarity indices: a fair-protocol reassessment and parameter design principles

Local similarity indices assign zero scores to node pairs without common neighbors, which limits link prediction in sparse networks; fusing node centrality with local similarity is a common remedy, but existing fusion studies use heterogeneous protocols and the robustness of their gains is unclear. Within a unified pie...

Ying-Ying Zhang, Cheng Zhao · 0 citations
Preprint Sep 2026

Fair Top-k Katz Centrality via Graph Design

Centrality measures are widely used to rank nodes in networked data, but fairness interventions for graph centrality typically target global score mass or modify the centrality operator rather than controlling who appears in the displayed top-k ranking. We study this top-k setting for Katz centrality. Given a target gr...

Ivan Qin, Prudence Wong, Lutz Oettershagen · 0 citations

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