scholarly journals A product of invariant random permutations has the same small cycle structure as uniform

2020 ◽  
Vol 25 (0) ◽  
Author(s):  
Slim Kammoun Kammoun ◽  
Mylène Maïda
1975 ◽  
Vol 25 (4) ◽  
pp. 559-565
Author(s):  
V E Tarakanov ◽  
V P Čistjakov

2012 ◽  
Vol 21 (5) ◽  
pp. 715-733 ◽  
Author(s):  
ALEXANDER GNEDIN ◽  
ALEXANDER IKSANOV ◽  
ALEXANDER MARYNYCH

We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path of a decreasing Markov chain on n integers. Under certain assumptions on the stick-breaking factor we prove a central limit theorem for the logarithm of the order of the permutation, thus extending the classical Erdős–Turán law for the uniform permutations and its generalization for Ewens' permutations associated with sampling from the PD/GEM(θ)-distribution. Our approach is based on using perturbed random walks to obtain the limit laws for the sum of logarithms of the cycle lengths.


10.37236/188 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Michael Lugo

This paper develops an analogy between the cycle structure of, on the one hand, random permutations with cycle lengths restricted to lie in an infinite set $S$ with asymptotic density $\sigma$ and, on the other hand, permutations selected according to the Ewens distribution with parameter $\sigma$. In particular we show that the asymptotic expected number of cycles of random permutations of $[n]$ with all cycles even, with all cycles odd, and chosen from the Ewens distribution with parameter $1/2$ are all ${1 \over 2} \log n + O(1)$, and the variance is of the same order. Furthermore, we show that in permutations of $[n]$ chosen from the Ewens distribution with parameter $\sigma$, the probability of a random element being in a cycle longer than $\gamma n$ approaches $(1-\gamma)^\sigma$ for large $n$. The same limit law holds for permutations with cycles carrying multiplicative weights with average $\sigma$. We draw parallels between the Ewens distribution and the asymptotic-density case and explain why these parallels should exist using permutations drawn from weighted Boltzmann distributions.


2009 ◽  
Vol 149 (1-2) ◽  
pp. 191-222 ◽  
Author(s):  
Volker Betz ◽  
Daniel Ueltschi

1992 ◽  
Vol 20 (3) ◽  
pp. 1567-1591 ◽  
Author(s):  
Richard Arratia ◽  
Simon Tavare

2012 ◽  
Vol 44 (1) ◽  
pp. 109-133 ◽  
Author(s):  
Nicholas M. Ercolani ◽  
Daniel Ueltschi

2018 ◽  
Author(s):  
Amy Victoria Newman ◽  
Thomas V. Pollet ◽  
Kristofor McCarty ◽  
Nick Neave ◽  
Tamsin Saxton

This study examined the anecdotal notion that people choose partners based on preferred characteristics that constitute their ‘type’. We gathered the eye colours of participants’ partners across their entire romantic history in three samples (student-centred, adult, and celebrity). We calculated the proportion of partners’ eye colours, and compared that to 100,000 random permutations of our observed dataset using t-tests. This was to investigate if the eye colour choices in the original datasets had greater consistency than in the permutations. Across all samples, we observed no good evidence that individuals make consistent eye colour choices, suggesting that eye colour may not be a priority when choosing a partner.


Author(s):  
Huseyin Acan ◽  
Charles Burnette ◽  
Sean Eberhard ◽  
Eric Schmutz ◽  
James Thomas
Keyword(s):  

Abstract Let ${\mathbb{P}}(ord\pi = ord\pi ')$ be the probability that two independent, uniformly random permutations of [n] have the same order. Answering a question of Thibault Godin, we prove that ${\mathbb{P}}(ord\pi = ord\pi ') = {n^{ - 2 + o(1)}}$ and that ${\mathbb{P}}(ord\pi = ord\pi ') \ge {1 \over 2}{n^{ - 2}}lg*n$ for infinitely many n. (Here lg*n is the height of the tallest tower of twos that is less than or equal to n.)


Sign in / Sign up

Export Citation Format

Share Document