Related papers: Convergence of sequences of ordered selections

A permutation sequence is said to be convergent if the density of occurrences of every fixed permutation in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue…

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. This paper discusses the use of seminorms for…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

A permutation sequence $(\sigma_n)_{n \in \mathbb{N}}$ is said to be convergent if, for every fixed permutation $\tau$, the density of occurrences of $\tau$ in the elements of the sequence converges. We prove that such a convergent sequence…

We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the…

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

We prove a general transfer theorem for multivariate random sequences with independent random indexes in the double array limit setting. We also prove its partial inverse providing necessary and sufficient conditions for the convergence of…

We examine a generalization of the binomial distribution associated with a strictly increasing sequence of numbers and we prove its Poisson-like limit. Such generalizations might be found in quantum optics with imperfect detection. We…

We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and…

Permutation entropy measures the complexity of deterministic time series via a data symbolic quantization consisting of rank vectors called ordinal patterns or just permutations. The reasons for the increasing popularity of this entropy in…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

We investigate stochastic comparisons between exponential family distributions and their mixtures with respect to the usual stochastic order, the hazard rate order, the reversed hazard rate order, and the likelihood ratio order. A general…

We prove a version of a general transfer theorem for random sequences with independent random indexes in the double array limit setting under relaxed conditions. We also prove its partial inverse providing the necessary and sufficient…

We present conditions that allow us to pass from the convergence of probability measures in distribution to the uniform convergence of the associated quantile functions. Under these conditions, one can in particular pass from the asymptotic…

We consider a finite sequence of random points in a finite domain of a finite-dimensional Euclidean space. The points are sequentially allocated in the domain according to a model of cooperative sequential adsorption. The main peculiarity…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

The celebrated Trotter approximation theorem provides a sufficient condition for the convergence of a sequence of operator semigroups in terms of the corresponding sequence of infinitesimal generators. There exist a few results on the rate…

Permutons, which are probability measures on the unit square $[0, 1]^2$ with uniform marginals, are the natural scaling limits for sequences of (random) permutations. We introduce a $d$-dimensional generalization of these measures for all…