mlsanityData to 13 Oct 2026

Belief propagation for permutations, rankings, and partial orders

arXiv 2110.00513 ↗First posted 1 Oct 2021cs.AI cond-mat.stat-mech cs.LGcited by 4

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

  1. 2017A physical model for efficient ranking in networkscited by 10
  2. 2016Feedback arcs and node hierarchy in directed networkscited by 2

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 1.

4 papers.