scholarly journals Fixed points and cycle structure of random permutations

2016 ◽  
Vol 21 (0) ◽  
Author(s):  
Sumit Mukherjee
1996 ◽  
Vol 48 (6) ◽  
pp. 1154-1169 ◽  
Author(s):  
Daniel J. Bernstein ◽  
Jeffrey C. Lagarias

AbstractThe 3x+1 mapTand the shift mapSare defined byT(x)= (3x+ 1)/2 forxodd,T(x) = x/2forxeven, whileS(x)= (x− 1)/2 forxodd,S(x) = x/2forxeven. The 3x+ 1 conjugacy map Φ on the 2-adic integersZ2conjugatesStoT, i.e.,Φ oSo Φ-1=T.The map Φ mod2ninduces a permutation ΦnonZ/2nZ. We study the cycle structure of Φn. In particular we show that it has order2n− 4forn ≥6. We also count 1-cycles of Φnfornup to 1000; the results suggest that Φ has exactly two odd fixed points. The results generalize to theax+ bmap, whereabis odd.


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.


2004 ◽  
Vol 14 (03) ◽  
pp. 209-215 ◽  
Author(s):  
GEORGE VOUTSADAKIS

In previous work, the limit structure of positive and negative finite threshold boolean networks without inputs (TBNs) over the complete digraph Kn was analyzed and an algorithm was presented for computing this structure in polynomial time. Those results are generalized in this paper to cover the case of arbitrary TBNs over Kn. Although the limit structure is now more complicated, containing, not only fixed-points and cycles of length 2, but possibly also cycles of arbitrary length, a simple algorithm is still available for its determination in polynomial time. Finally, the algorithm is generalized to cover the case of symmetric finite boolean networks over Kn.


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

2014 ◽  
Vol 61 ◽  
pp. 102-124 ◽  
Author(s):  
Persi Diaconis ◽  
Steven N. Evans ◽  
Ron Graham

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

Sign in / Sign up

Export Citation Format

Share Document