The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A192053 Maximum probability of permutation from bad "shuffle" times n^n. 1
 1, 2, 5, 15, 47, 159, 543, 1931, 6879, 25118 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Consider the "shuffle": start with p(i)=i for i in 1..n. Then, for i in 1..n, pick j uniformly at random from 1..n, and swap p(i) and p(j). This "shuffle" results in a very non-uniform distribution. The probability of each permutation will be divisible by n^n (because there are n^n possible choices for the random draws). Empirically the most likely permutation is 2, 3, ..., floor(n/2), 1, floor(n/2)+2, floor(n/2)+3, ..., n, floor(n/2)+1, with probability a(n)/n^n. For n odd, taking floor(n/2) = (n-1)/2 or (n+1)/2 results in two equally likely permutations. Empirically the least likely permutation is n, 1, 2, ..., n-1, with probability 2^(n-1)/n^n. The first empirical observation is known to be false, see Proposition 2.9 of Schmidt and Simion. Therefore, a(n) > A013560(n) for sufficiently large n. - Sean A. Irvine, Mar 29 2022 LINKS Table of n, a(n) for n=1..10. Frank Schmidt and Rodica Simion, Card shuffling and a transformation on S_n, Aequationes Math. 44 (1992), no. 1, 11-34. EXAMPLE The sequence of random j values chosen determines the permutation. For example, for n=3, the sequence j=3,1,3 results in swap(p(1),p(3)), swap(p(2),p(1)), swap(p(3),p(3)), and hence in permutation 2,3,1. For n=3, permutations arise from sequences of j as follows: 1,2,3: j=1,2,3; j=1,3,2; j=2,1,3; j=3,2,1 with probability 4/27; 1,3,2: j=1,2,2; j=1,3,3; j=2,1,2; j=2,3,1; j=3,1,1 with probability 5/27; 2,1,3: j=1,1,3; j=2,2,3; j=2,3,2; j=3,1,2; j=3,3,1 with probability 5/27; 2,3,1: j=1,1,2; j=1,3,1; j=2,2,2; j=2,3,3; j=3,1,3 with probability 5/27; 3,1,2: j=1,1,1; j=2,2,1; j=3,2,2; j=3,3,3 with probability 4/27; 3,2,1: j=1,2,1; j=2,1,1; j=3,2,3; j=3,3,2 with probability 4/27. For n=8, the most likely permutation is 2,3,4,1,6,7,8,5 with probability 1931/8^8. CROSSREFS Cf. A013560. Sequence in context: A149920 A149921 A149922 * A013560 A149923 A219231 Adjacent sequences: A192050 A192051 A192052 * A192054 A192055 A192056 KEYWORD nonn,more AUTHOR David Applegate, Jun 21 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 04:08 EST 2023. Contains 367681 sequences. (Running on oeis4.)