School of Computer Science and Engineering, Nanjing University of Science and Technology, Nanjing, Jiangsu, China.

---

Abstract—Numerous centrality measures have been established to identify the important nodes in static networks, among them, HITS centrality is widely used as a ranking method. In this paper, we extend the classical HITS centrality to rank nodes in multilayer temporal networks with directed edges. First, we use a sixth-order tensor to represent multilayer temporal network and then introduce random walks in the established sixth-order tensor by constructing six transition probability tensors. Second, we establish tensor equations based on these constructed tensors to obtain six centrality vectors: two for the nodes, two for the layers and two for the time stamps. Besides, we prove the existence of the proposed centrality measure under some conditions. Finally, we experimentally show the effectiveness of the proposed centrality on an synthetic network and a real-world network.

Index Terms—Multilayer temporal networks, centrality measure, HITS, transition probability tensors.

[PDF]

Cite: Laishui Lv, Kun Zhang, "Multi-Dimensional HITS Based on Random Walks for Multilayer Temporal Networks," Journal of Computers vol. 15, no. 3, pp. 98-105, 2020.

Copyright © 2020 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).