We use moment method to understand the cycle structure of the composition of independent invariant permutations. We prove that under a good control on fixed points and cycles of length 2, the limiting joint distribution of the number of small cycles is the same as in the uniform case i.e. for any positive integer k, the number of cycles of length k converges to the Poisson distribution with parameter 1/k and is asymptotically independent of the number of cycles of length k' different from k.En utilisant la méthode des moments, nous étudions la structure en cycles de la composition de permutations invariantes par conjugaison indépendantes. Nous montrons que, sous réserve d'un bon contrôle du nombre de points fixes et de cycles de longueur 2...
AbstractA permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ, t...
AbstractWe prove a conjecture of D. Foata and M. P. Schützenberger about a property on equidistribut...
We study the mixing properties of permutations obtained as a product of two uniformly random permuta...
We present some Markovian approaches to prove universality results for some functions on the symmetr...
We consider random permutations derived by sampling from stick-breaking partitions of the unit inter...
AbstractUnimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycl...
We consider uniform random permutations of length n conditioned to have no cyclelonger than nβ with ...
On présente dans cette thèse des techniques de preuve d'universalité pour les permutations aléatoire...
Permutations contained in transitive subgroups, Discrete Analysis 2016:12, 36 pp. This paper is par...
AbstractWe introduce the notion of crossings and nestings of a permutation. We compute the generatin...
AbstractBouvel and Pergola introduced the notion of minimal permutations in the study of the whole g...
Models for random permutations with nonuniform probability distribution are ubiq-uitous in many bran...
A subset of cycles comprising a permutation σ in the symmetric group Sn, n ∈ N, is called a divisor ...
A subset of cycles comprising a permutation σ in the symmetric group Sn, n ∈ N, is called a divisor ...
28 pagesIn this text, we consider random permutations which can be written as free words in several ...
AbstractA permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ, t...
AbstractWe prove a conjecture of D. Foata and M. P. Schützenberger about a property on equidistribut...
We study the mixing properties of permutations obtained as a product of two uniformly random permuta...
We present some Markovian approaches to prove universality results for some functions on the symmetr...
We consider random permutations derived by sampling from stick-breaking partitions of the unit inter...
AbstractUnimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycl...
We consider uniform random permutations of length n conditioned to have no cyclelonger than nβ with ...
On présente dans cette thèse des techniques de preuve d'universalité pour les permutations aléatoire...
Permutations contained in transitive subgroups, Discrete Analysis 2016:12, 36 pp. This paper is par...
AbstractWe introduce the notion of crossings and nestings of a permutation. We compute the generatin...
AbstractBouvel and Pergola introduced the notion of minimal permutations in the study of the whole g...
Models for random permutations with nonuniform probability distribution are ubiq-uitous in many bran...
A subset of cycles comprising a permutation σ in the symmetric group Sn, n ∈ N, is called a divisor ...
A subset of cycles comprising a permutation σ in the symmetric group Sn, n ∈ N, is called a divisor ...
28 pagesIn this text, we consider random permutations which can be written as free words in several ...
AbstractA permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ, t...
AbstractWe prove a conjecture of D. Foata and M. P. Schützenberger about a property on equidistribut...
We study the mixing properties of permutations obtained as a product of two uniformly random permuta...