This Research Digest entry draws on a single source: an arXiv preprint (2602.10293v2) titled "Metric geometry for ranking-based voting: Tools for learning electoral structure." Because there is only one source, there are no conflicting accounts to reconcile; the summary below follows the abstract as posted.
The paper develops the metric geometry of ranking statistics. Its central result is a proof that the two major permutation distances in the statistics literature — Kendall tau and Spearman footrule — extend naturally to incomplete rankings. This matters for ranking-based voting, where ballots are often partial rather than full orderings of candidates.
The stated aim is to provide tools for learning electoral structure. By giving incomplete rankings a well-defined geometric footing, the distances could support analysis of how voters cluster and how alternatives relate. The abstract is truncated mid-sentence, so details of the proofs and applications are not available from this source alone.