Permuton and local limits for the Luce model
Jacopo Borga, Sourav Chatterjee, Persi Diaconis
TL;DR
This work analyzes permutations drawn from the Luce model, where sampling without replacement is driven by prescribed positive weights. Under minimal weight assumptions, it establishes a permuton limit with an explicit density and proves convergence of pattern densities, along with a quenched Benjamini–Schramm local limit and a central limit theorem for consecutive pattern occurrences, plus a CLT for inversions. The results encompass generic weights and applications to Sukhatme and exponential Sukhatme weights, with precise formulas for limiting densities and variances. The findings illuminate global and local structural properties of Luce-permuted sequences and lay groundwork for statistical applications and further open questions in permutation limit theory and cycle structure.
Abstract
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities proportional to prescribed positive weights. These permutations arise in applications such as ranking models, the Tsetlin library, and related Markov processes. Under minimal assumptions on the weights, we establish a permuton limit theorem describing the global behavior of Luce-distributed permutations and derive an explicit density of the limiting permuton. We further compute limiting pattern densities and analyze the differences between exact Luce permutations and their permuton approximations. We also study the local convergence of these permutations, proving a quenched Benjamini--Schramm limit and a central limit theorem for consecutive pattern occurrences. Finally, we prove a central limit theorem for the number of inversions.
