Convergence of sequences of ordered selections
B. Fazekas, I. Fazekas
TL;DR
The paper addresses the limits of ordered selections with $\frac{m}{n}\to \lambda$ by extending permutation limit theory to generalized permutons. It develops a convergence framework based on subpermutation densities and marginal distributions, introducing $\lambda$-permutons and generalized permutons as limit objects. It proves that convergent $(n,m)$-permutation sequences have generalized permuton limits and that every generalized permuton is realizable as a limit by some $(n,m)$-permutation sequence, unifying several convergence notions via $d_\infty$, $d_\square$, and weak convergence. This generalizes Hoppen's results on permutation limits to ordered selections and provides a robust toolset for analyzing asymptotics of these structures.
Abstract
In this paper, we introduce a convergence notion for ordered selections. Our convergence notion is based on subpermutation densities and convergences of the marginal distributions. A particular case of this convergence is the well-known convergence of permutation sequences. We also introduce a family of probability measures called generalized permutons. We show that in the family of generalized permutons several convergence notions are equivalent. We embed the set of ordered selections to the set of generalized permutons. We prove that any convergent sequence of ordered selections has a limit which is a generalized permuton. Moreover, any generalized permuton is the limit of a sequence of ordered selections. Our results are generalizations of well-known theorems on convergence of permutation sequences to permutons.
