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:
“Between us two its not a star at all.
Its a new patented electric light,
Put up on trial by that Jerseyite
So much is being now expected of....”
—Robert Frost (18741963)
“There is not to be found, in all history, any miracle attested by a sufficient number of men, of such unquestioned good sense, education, and learning, as to secure us against all delusion in themselves ... beyond all suspicion of any design to deceive others ... and at the same time attesting facts, performed in such a public manner, and in so celebrated a part of the world, as to render the detection unavoidable.”
—David Hume (17111776)
“And catch the gleaming of a random light,
That tells me that the ship I seek is passing, passing.”
—Paul Laurence Dunbar (18721906)




