Time-sensitive propagation values discount centrality measure

DOI10.1007/S00607-024-01265-2MaRDI QIDQ6556342zbMATH OpenFDO

Authors Salman Mokhtarzadeh, Behzad Zamani Dehkordi, Mohammad Mosleh, Ali Barati

Publication date 17 June 2024

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00607-024-01265-2

zbMATH Keywords

fast time-sensitive harmonic centrality measuremaximize influencepropagation delaytime-sensitive propagation values discount centrality measure

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Review text

The paper studies the time-sensitive propagation values discount centrality measure and modifies the valuable path-finding process in the time-sensitive harmonic method to provide the fast time-sensitive harmonic algorithm. Two time-sensitive measures are introduced to improve the speed and accuracy of centrality-based delay-aware influence maximization methods. The first one uses reachability techniques to improve the execution speed of the time-sensitive harmonic method. The influence of the selected node on the selection of the other influential nodes is studied in the time-sensitive propagation values discount measure. The centrality-based methods ignore the information propagation model and therefore, the overlap between the selected nodes is not computable.

Recommendations

• Efficiency centrality in time-varying graphs
• Betweenness in time dependent networks
• PageRank centrality for temporal networks
• Diffusion and targeting centrality
• Approximation methods for influence maximization in temporal networks

This page was built for publication: Time-sensitive propagation values discount centrality measure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6556342)