Belief propagation for permutations, rankings, and partial orders
Not on the map. Why?
Abstract (arXiv)
Many datasets give partial information about an ordering or ranking by indicating which team won a game, which item a user prefers, or who infected whom. We define a continuous spin system whose Gibbs distribution is the posterior distribution on permutations, given a probabilistic model of these interactions. Using the cavity method we derive a belief propagation algorithm that computes the marginal distribution of each node's position. In addition, the Bethe free energy lets us approximate the number of linear extensions of a partial order and perform model selection between competing probabilistic models, such as the Bradley-Terry-Luce model of noisy comparisons and its cousins.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). Builds on 2 of its 33 references that are in the map. First posted on arXiv 1 Oct 2021.
Builds on
2 of 33 references.
References · 2
- 2017A physical model for efficient ranking in networkscited by 10
- 2016Feedback arcs and node hierarchy in directed networkscited by 2
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 1.
4 papers.
- 2025Estimation of partial rankings from sparse, noisy comparisonscited by 3
- 2023Exact and rapid linear clustering of networks with dynamic programmingcited by 2
- 2025Model inference for ranking from pairwise comparisonscited by 0
- 2026Generalized Priority-Aware Shapley Valuecited by 0
- 2026Generalized Priority-Aware Shapley Value14 May 2026
- 2025Model inference for ranking from pairwise comparisons17 Dec 2025
- 2025Estimation of partial rankings from sparse, noisy comparisons5 Jan 2025
- 2023Exact and rapid linear clustering of networks with dynamic programming25 Jan 2023