On eigenvector-like centralities for temporal networks: Discrete vs. continuous time scales

Centrality measures play a central role in Complex Networks Theory as much as they provide a tool to rank nodes by their relevance in the processes occurring in a network. In this paper we propose a model for the eigenvector-like centralities of temporal networks that evolve on a continuous time scale. We analytically prove that these centralities can be approximated by the centralities of temporal networks on discrete time scale.