Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Efficient Rank Aggregation via Lehmer Codes   We propose a novel rank aggregation method based on converting permutations
into their corresponding Lehmer codes or other subdiagonal images. Lehmer
codes, also known as inversion vectors, are vector representations of
permutations in which each coordinate can take values not restricted by the
values of other coordinates. This transformation allows for decoupling of the
coordinates and for performing aggregation via simple scalar median or mode
computations. We present simulation results illustrating the performance of
this completely parallelizable approach and analytically prove that both the
mode and median aggregation procedure recover the correct centroid aggregate
with small sample complexity when the permutations are drawn according to the
well-known Mallows models. The proposed Lehmer code approach may also be used
on partial rankings, with similar performance guarantees.

26
The categories of this paper are: bayes-an
32
The categories of this paper are: atom-ph
19
The categories of this paper are: eess
27
The categories of this paper are: comp-gas
12
The categories of this paper are: nucl-th
21
The categories of this paper are: adap-org
30
The categories of this paper are: q-alg
35
The categories of this paper are: mtrl-th
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int
6
The categories of this paper are: astro-ph
25
The categories of this paper are: patt-sol
9
The categories of this paper are: nlin
28
The categories of this paper are: alg-geom