Expected Number of Transpositions of A Random Permutation
We can use the disjoint cycle decomposition of a permutation to factorize it as a product of transpositions by replacing a cycle of length k by transpositions. E.g. the cycle factors as . The function for cycles is equal to and we obtain
and
Hence the expected number of transpositions is
We could also have obtained this formula by noting that the number of transpositions is obtained by adding the lengths of all cycles (which gives n) and subtracting one for every cycle (which gives by the previous section).
Note that again generates the unsigned Stirling numbers of the first kind, but in reverse order. More precisely, we have
To see this, note that the above is equivalent to
and that
which we saw to be the EGF of the unsigned Stirling numbers of the first kind in the section on permutations consisting of precisely m cycles.
Read more about this topic: Random Permutation Statistics
Famous quotes containing the words expected, number and/or random:
“We are expected to put the utmost energy, of every power that we have, into the service of our fellow men, never sparing ourselves, not condescending to think of what is going to happen to ourselves, but ready, if need be, to go to the utter length of self-sacrifice.”
—Woodrow Wilson (18561924)
“... [woman suffrage] has made little difference beyond doubling the number of voters. There is no womans vote as such. They divide up just about as men do.”
—Alice Roosevelt Longworth (18841980)
“Novels as dull as dishwater, with the grease of random sentiments floating on top.”
—Italo Calvino (19231985)




