Time-sensitive propagation values discount centrality measure (Q6556342)

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.