Cycles of free words in several independent random permutations with restricted cycle lengths

DOI10.1512/IUMJ.2010.59.4119MaRDI QIDQ3096342zbMATHOpenAlexFDO

Authors Florent Benaych-Georges

Publication date 8 November 2011

Published in Indiana University Mathematics Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0611500

zbMATH Keywords

Poisson distributionfree grouprandom permutationscyclic reductionsconvergence in repartitionedge k-colored graphs

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)

Abstract: In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word $w$ in letters $g_1,g_1^{-1},\mathrm{...},g_k,g_k^{-1}$, secondly, for all $n$, we introduce a $k$-tuple $s_1(n),\mathrm{...},s_k(n)$ of independent random permutations of $1,\mathrm{...},n$, and the random permutation $sigm{a}_n$ we are going to consider is the one obtained by replacing each letter $g_i$ in $w$ by $s_i(n)$. For example, for $w=g_1{g}_2{g}_3{g}_2^{-1}$, $sigm{a}_n=s_1(n)circ{s}_2(n)circ{s}_3(n)circ{s}_2(n{)}^{-1}$. Moreover, we restrict the set of possible lengths of the cycles of the $s_i(n)$'s: we fix sets $A_1,\mathrm{...},A_k$ of positive integers and suppose that for all $n$, for all $i$, $s_i(n)$ is uniformly distributed on the set of permutations of $1,\mathrm{...},n$ which have all their cycle lengths in $A_i$. For all positive integer $l$, we are going to give asymptotics, as $n$ goes to infinity, on the number $N_l(sigm{a}_n)$ of cycles of length $l$ of $sigm{a}_n$. We shall also consider the joint distribution of the random vectors $(N_1(sigm{a}_n),\mathrm{...},N_l(sigm{a}_n))$. We first prove that the order of $w$ in a certain quotient of the free group with generators $g_1,\mathrm{...},g_k$ determines the rate of growth of the random variables $N_l(sigm{a}_n)$ as $n$ goes to infinity. We also prove that in many cases, the distribution of $N_l(sigm{a}_n)$ converges to a Poisson law with parameter $1/l$ and that the random variables $N_1(sigm{a}_n),N_2(sigm{a}_n),\mathrm{...}$ are asymptotically independent. We notice the surprising fact that from this point of view, many things happen as if $sigm{a}_n$ were uniformly distributed on the $n$-th symmetric group.

Recommendations

• On the number of cycles of given length of a free word in several random permutations
• On permutations with cycle lengths in a random set
• Random permutations with cycle lengths in a given finite set
• On random permutations without cycles of some lengths
• On the probability of coincidence of cycle lengths for independent random permutations with given number of cycles
• The cycle structure of random permutations

Cited in

(9)

• Local statistics of random permutations from free products
• On the number of cycles of given length of a free word in several random permutations
• Random permutations with cycle weights
• Growth in free groups (and other stories) -- twelve years later
• Limit distributions for Euclidean random permutations
• On the cycle structure of the product of random maximal cycles
• Counting words of minimum length in an automorphic orbit.
• Cycle structure of random permutations with cycle weights
• Statistics of finite degree covers of torus knot complements

This page was built for publication: Cycles of free words in several independent random permutations with restricted cycle lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096342)