Liao, Hao Mariani, Manuel Sebastian Medo, Matúš Zhang, Yi-Cheng Zhou, Ming-Yang 2017-05-19 Complex networks have emerged as a simple yet powerful framework to represent and analyze a wide range of complex systems. The problem of ranking the nodes and the edges in complex networks is critical for a broad range of real-world problems because it affects how we access online information and products, how success and talent are evaluated in human activities, and how scarce resources are allocated by companies and policymakers, among others. This calls for a deep understanding of how existing ranking algorithms perform, and which are their possible biases that may impair their effectiveness. Many popular ranking algorithms (such as Google’s PageRank) are static in nature and, as a consequence, they exhibit important shortcomings when applied to real networks that rapidly evolve in time. At the same time, recent advances in the understanding and modeling of evolving networks have enabled the development of a wide and diverse range of ranking algorithms that take the temporal dimension into account. The aim of this review is to survey the existing ranking algorithms, both static and time-aware, and their applications to evolving networks. We emphasize both the impact of network evolution on well-established static algorithms and the benefits from including the temporal dimension for tasks such as prediction of network traffic, prediction of future links, and identification of significant nodes. application/pdf https://folia.unifr.ch/global/documents/306299 https://folia.unifr.ch/documents/306299/files/zha_rcn.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.physrep.2017.05.001 info:eu-repo/semantics/openAccess License undefined Physics Reports. - 2017, vol. 689, p. 1–54 info:eu-repo/classification/udc/53 Ranking in evolving complex networks http://purl.org/coar/resource_type/c_6501