Expected Number of Cycles of A Given Size m
In this problem we use a bivariate generating function g(z, u) as described in the introduction. The value of b for a cycle not of size m is zero, and one for a cycle of size m. We have
or
This means that the expected number of cycles of size m in a permutation of length n less than m is zero (obviously). A random permutation of length at least m contains on average 1/m cycles of length m. In particular, a random permutation contains about one fixed point.
The OGF of the expected number of cycles of length less than or equal to m is therefore
where Hm is the mth harmonic number. Hence the expected number of cycles of length at most m in a random permutation is about ln m.
Read more about this topic: Random Permutation Statistics
Famous quotes containing the words expected, number, cycles and/or size:
“For I had expected always
Some brightness to hold in trust,
Some final innocence
To save from dust;”
—Stephen Spender (19091995)
“He is the greatest artist who has embodied, in the sum of his works, the greatest number of the greatest ideas.”
—John Ruskin (18191900)
“The stars which shone over Babylon and the stable in Bethlehem still shine as brightly over the Empire State Building and your front yard today. They perform their cycles with the same mathematical precision, and they will continue to affect each thing on earth, including man, as long as the earth exists.”
—Linda Goodman (b. 1929)
“It is very considerably smaller than Australia and British Somaliland put together. As things stand at present there is nothing much the Texans can do about this, and ... they are inclined to shy away from the subject in ordinary conversation, muttering defensively about the size of oranges.”
—Alex Atkinson, British humor writer. repr. In Present Laughter, ed. Alan Coren (1982)


