A meandric system of size is the set of loops formed from two arc diagrams (non-crossing perfect matchings) on , one drawn above the real line and the other below the real line. A uniform random meandric system can be viewed as a random planar map decorated by a Hamiltonian path (corresponding to the real …
We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called μ-random permutations. We also introduce and study a new general class of models of random permutations, called Gibbs permutation models, which combines and generalizes μ-random permutations and the celebrated Mallows model for …
The Baxter permuton is a random probability measure on the unit square which describes the scaling limit of uniform Baxter permutations. We find an explict formula for the expectation of the Baxter permuton, i.e. the density of its intensity measure. This answers a question of Dokos and Pak (2014). We also prove that all pattern …
We construct a new family of random permutons, called skew Brownian permuton, which describes the limits of various models of random constrained permutations. This family is parametrized by two real parameters. For a specific choice of the parameters, the skew Brownian permuton coincides with the Baxter permuton, i.e. the permuton limit of Baxter permutations. We …
We recently introduced a new universal family of permutons, depending on two parameters, called skew Brownian permuton. For some specific choices of the parameters, the skew Brownian permuton coincides with some previously studied permutons: the biased Brownian separable permuton and the Baxter permuton. The latter two permutons are degenerate cases of the skew Brownian permuton. In …
We study the feasible region for consecutive patterns of pattern-avoiding permutations. More precisely, given a family of permutations avoiding a fixed set of patterns, we study the limit of proportions of consecutive patterns on large permutations of . These limits form a region, which we call the pattern-avoiding feasible region for . We show that, …
Notation: Given , we set and . We also set . The model We consider a league of teams denoted by whose initial random strengths are denoted by . In the league every team plays matches, one against each of the remaining teams . Note that there are in total matches in the league. These …
Baxter permutations, plane bipolar orientations, and a specific family of walks in the non-negative quadrant, called tandem walks, are well-known to be related to each other through several bijections. We introduce a further new family of discrete objects, called coalescent-walk processes and we relate it to the three families mentioned above. We prove joint Benjamini–Schramm …
We begin with the definition of generating tree. Since we are interested in the study of permutations, we restrict the definition to these specific objects. We need the following preliminary construction. Definition. Given a permutation and an integer we denote by the permutation obtained from by appending a new final value equal to and shifting …
A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal points. Permutations without internal points have been studied under the name of …