PageRank centrality for temporal networks

In this paper, we propose a new centrality measure for ranking the nodes and time layers of temporal networks simultaneously, referred to as the f-PageRank centrality. The f-PageRank values of nodes and time layers in temporal networks are obtained by solving the eigenvector of a multi-homogeneous map. The existence and uniqueness of the proposed centrality measure are also guaranteed by existing results, under some reasonable conditions. The numerical experiments on a synthetic temporal network and two real-world temporal networks (i.e., Email-Eu-core and CollegeMsg temporal networks) show that the proposed centrality outperforms some existing centrality measures.