Temporal Betweenness Centrality on Shortest Paths Variants
share
Betweenness centrality has been extensively studied since its introduction in 1977 as a measure of node importance in graphs. This measure has found use in various applications and has been extended to temporal graphs with time-labeled edges. Recent research by Buß et al. <cit.> and Rymar et al. <cit.> has shown that it is possible to compute the shortest path betweenness centrality of all nodes in a temporal graph in O(n^3 T^2) and O(n^2 m T^2) time, respectively, where T is the maximum time, m is the number of temporal edges, and n is the number of nodes. These approaches considered paths that do not take into account contributions from intermediate temporal nodes. In this paper, we study the classical temporal betweenness centrality paths that we call passive shortest paths, as well as an alternative variant that we call active shortest paths, which takes into account contributions from all temporal nodes. We present an improved analysis of the running time of the classical algorithm for computing betweenness centrality of all nodes, reducing the time complexity to O(n m T+ n^2 T). Furthermore, for active paths, we show that the betweenness centrality can be computed in O(n m T+ n^2 T^2). We also show that our results hold for different shortest paths variants. Finally, we provide an open-source implementation of our algorithms and conduct experiments on several real-world datasets. We compare the results of the two variants on both the node and time dimensions of the temporal graph, and we also compare the temporal betweenness centrality to its static counterpart. Our experiments suggest that for the shortest foremost variant looking only at the first 10% of the temporal interaction is a very good approximation for the overall top ranked nodes.
READ FULL TEXT