Ranking in evolving complex networks
From MaRDI portal
Publication:2364306
DOI10.1016/J.PHYSREP.2017.05.001zbMATH Open1366.91124arXiv1704.08027OpenAlexW3102590789MaRDI QIDQ2364306FDOQ2364306
Authors: Hao Liao, Manuel Sebastian Mariani, Matúš Medo, Yi-Cheng Zhang, Ming-Yang Zhou 
Publication date: 18 July 2017
Published in: Physics Reports (Search for Journal in Brave)
Abstract: 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. Well-established ranking algorithms (such as the popular 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. The 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 real network traffic, prediction of future links, and identification of highly-significant nodes.
Full work available at URL: https://arxiv.org/abs/1704.08027
Recommendations
Statistical ranking and selection procedures (62F07) Applications of statistics (62P99) Statistical methods; economic indices and measures (91B82) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Cites Work
- What's in a crowd? Analysis of face-to-face behavioral networks
- Statistical mechanics of complex networks
- Bagging predictors
- A survey of cross-validation procedures for model selection
- Complex networks: structure and dynamics
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- An index to quantify an individual's scientific research output
- A new status index derived from sociometric analysis
- A survey on concept drift adaptation
- Networks. An introduction.
- Determining Lyapunov exponents from a time series
- Authoritative sources in a hyperlinked environment
- Scale-Free Networks
- Social and economic networks.
- Google's PageRank and beyond. The science of search engine rankings
- Title not available (Why is that?)
- A Survey on PageRank Computing
- Connectivity and inference problems for temporal networks
- The centrality index of a graph
- A review of theory and practice in scientometrics
- Cross-Validation of Regression Models
- Nestedness in networks: A theoretical model and some applications
- Chaos. From simple models to complex systems
- PageRank beyond the web
- Citation statistics
- Title not available (Why is that?)
- Identifying influential spreaders by weighted leaderrank
- Network science. With Márton Pósfai
- Statistical physics of vaccination
- Axioms for Centrality
- Toward link predictability of complex networks
- Approximating PageRank from In-Degree
- A Singular Perturbation Approach for Choosing the PageRank Damping Factor
- Economic complexity: conceptual grounding of a new metrics for global competitiveness
- The mathematics of non-linear metrics for nested networks
- Link prediction based on temporal similarity metrics using continuous action set learning automata
- Modeling mutual feedback between users and recommender systems
- A \(k\)-shell decomposition method for weighted networks
- Cross-evaluation of metrics to estimate the significance of creative works
- Localized eigenvectors of the non-backtracking matrix
- Random walk centrality for temporal networks
- Eigenvector-based centrality measures for temporal networks
- Algorithms and Models for the Web-Graph
- Time-Aware Authority Ranking
Cited In (33)
- Identifying critical nodes in complex networks based on neighborhood information
- Tensor-based mathematical framework and new centralities for temporal multilayer networks
- Identifying influential nodes to enlarge the coupling range of pinning controllability
- Fragmenting complex network based on non-backtracking matrix
- Random walks and diffusion on networks
- Ranking edges by their impact on the spectral complexity of information diffusion over networks
- Ranking nodes in general networks: a Markov multi-chain approach
- Synchronization of heterogeneous and uncertain networks via adaptive intermittent pinning control
- Persistence in complex systems
- A note on the \(H\) index in random networks
- A physical pathway to understand individual's labeling behavior in signed social networks
- Structure-oriented prediction in complex networks
- Algorithmic bias amplification via temporal effects: the case of PageRank in evolving networks
- Dismantling complex networks based on the principal eigenvalue of the adjacency matrix
- Diffusion-based location-aware recommender systems
- Big networks: a survey
- Incentive rate determination in viral marketing
- Analytical connection between thresholds and immunization strategies of SIS model in random networks
- Tunable eigenvector-based centralities for multiplex and temporal networks
- Discovering influential data objects over time
- Disease spreading model considering the activity of individuals on complex networks
- Dynamic PageRank using evolving teleportation
- Temporal similarity metrics for latent network reconstruction: the role of time-lag decay
- A new similarity in clustering through users' interest and social relationship
- Competitor identification with memory in a dynamic financial transaction network
- A new method for comparing rankings through complex networks: model and analysis of competitiveness of major European soccer leagues
- Cooperation of local and collective synchronization in complex networks
- A new ranking algorithm and an evolutionary model based on comprehensive weighted clique degree for complex network
- Ranking game on networks: the evolution of hierarchical society
- Ranking by inspiration: a network science approach
- Supracentrality analysis of temporal networks with directed interlayer coupling
- Temporal link prediction methods based on behavioral synchrony
- Connecting patterns inspire link prediction in complex networks
Uses Software
This page was built for publication: Ranking in evolving complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2364306)
