REVIEW
PageRank and the Bradley-Terry model
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
PageRank and the Bradley-Terry model are competing approaches to ranking entities such as teams in sports tournaments or journals in citation networks. The Bradley-Terry model is a classical statistical method for ranking based on paired comparisons. The PageRank algorithm ranks nodes according to their importance in a network. Whereas Bradley-Terry scores are computed via maximum likelihood estimation, PageRanks are derived from the stationary distribution of a Markov chain. More recent work has shown maximum likelihood estimates for the Bradley-Terry model may be approximated from such a limiting distribution, an interesting connection that has been discovered and rediscovered over the decades. Here we show - through relatively simple mathematics - a connection between paired comparisons and PageRank that exploits the quasi-symmetry property of the Bradley-Terry model. This motivates a novel interpretation of Bradley-Terry scores as 'scaled' PageRanks, and vice versa, with direct implications for citation-based journal ranking metrics.
Discussion (0). Continue with ORCID to comment.