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:
“I believe that all women of working ages and physical capacity, regardless of income, should be expected to earn their livings either in or out of the home. Until this attitude prevails I believe the position of women will be uncertain and undignified, in spite of poetic rhapsodies to the contrary.”
—Mary Barnett Gilson (1877?)
“States strong enough to do good are but few.
Their number would seem limited to three.”
—Robert Frost (18741963)
“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)
“Eat your meals according to the size of your bowl.”
—Chinese proverb.


