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:
“Twenty cant be expected to tolerate sixty in all things, and sixty gets bored stiff with twentys eternal love affairs.”
—Emily Carr (18711945)
“As Jerome expanded, its chances for the title, the toughest little town in the West, increased and when it was incorporated in 1899 the citizens were able to support the claim by pointing to the number of thick stone shutters on the fronts of all saloons, gambling halls, and other places of business for protection against gunfire.”
—Administration in the State of Ariz, U.S. public relief program (1935-1943)
“Assemble, first, all casual bits and scraps
That may shake down into a world perhaps;
People this world, by chance created so,
With random persons whom you do not know”
—Robert Graves (18951985)