Limits of PageRank-based ranking methods in sports data
arXiv:2012.06366
Abstract
While PageRank has been extensively used to rank sport tournament participants (teams or individuals), its superiority over simpler ranking methods has been never clearly demonstrated. We use sports results from 18 major leagues to calibrate a state-of-art model for synthetic sports results. Model data are then used to assess the ranking performance of PageRank in a controlled setting. We find that PageRank outperforms the benchmark ranking by the number of wins only when a small fraction of all games have been played. Increased randomness in the data, such as intrinsic randomness of outcomes or advantage of home teams, further reduces the range of PageRank's superiority. We propose a new PageRank variant which outperforms PageRank in all evaluated settings, yet shares its sensitivity to increased randomness in the data. Our main findings are confirmed by evaluating the ranking algorithms on real data. Our work demonstrates the danger of using novel metrics and algorithms without considering their limits of applicability.
arXiv comment19 pages, 6 figures
References in corpus (11)
- Link Prediction in Complex Networks: A Survey
- Models for Paired Comparison Data: A Review with Emphasis on Dependent Data
- Who is the best player ever? A complex network analysis of the history of professional tennis
- An application of incomplete pairwise comparison matrices for ranking top tennis players
- A network-based ranking system for American college football
- Ranking nodes in growing networks: When PageRank fails
- A network-based dynamical ranking system for competitive sports
- The Advantage of Playing Home in NBA: Microscopic, Team-Specific and Evolving Features
- Identifying the greatest team and captain - A complex network approach to cricket matches
- Universal scaling in sports ranking
- PageRank Approach to Ranking National Football Teams