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:
“Most governments have been based, practically, on the denial of equal rights of men ... ours began, by affirming those rights. They said, some men are too ignorant, and vicious, to share in government. Possibly so, said we; and, by your system, you would always keep them ignorant, and vicious. We proposed to give all a chance; and we expected the weak to grow stronger, the ignorant wiser; and all better, and happier together.”
—Abraham Lincoln (18091865)
“Black lady,
what will I do
without your two flowers?
I have inhabited you, number by number.
I have pushed you in and out like a needle.”
—Anne Sexton (19281974)
“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)
“O hideous little bat, the size of snot,
With polyhedral eye and shabby clothes,”
—Karl Shapiro (b. 1913)