Michael Lugo just recently considered an issue
including the allotment of swimmers to swim lanes at random, ending.
If we calculate this for big!! n!! we get !! f( n) sim 0.4323 n!!,.
which agrees with the Monte Carlo simulations … The.
constant!! 0.4323!! is $$ frac1 .$$
I love when stuff like this takes place. The computer is fantastic at doing a.
fast random simulation and getting you some odd number, and you.
have no concept what it really means. However mathematical method can.
unmask the unusual number and learn its real identity. (” It was Old Male.
Haskins all along!”)
A couple of years back Math Stack Exchange had.
Expected Number and Size of Contiguously Filled Bins,.
and although it wasn’t precisely what was asked, I ended up looking into.
this concern: We take!! n !! balls and throw them at random into!! n !!
bins that are lined up in a row. A maximal adjoining sequence of.
all-empty or all-nonempty bins is called a “cluster”..
here we have 13 balls that I positioned arbitrarily into 13 bins:
In this example, there are 8 clusters, of sizes 1, 1, 1, 1, 4, 1,.
3, 1. Is this typical? What’s the expected cluster size?
It’s easy to utilize Monte Carlo approaches and find that when!! n!! is.
large, the average cluster size is roughly !! 2.15013!!. Do you.
acknowledge this number? I didn’t.
But it’s not hard to do the estimation analytically and discover that.
that the factor it’s roughly !! 2.15013!! is that the actual.
answer is $$ frac1 2( e ^ – e ^ ) $$ which is around !! 2.15013!!.
Mathematics is remarkable and terrific.
( The expressions in the options of M. Lugo’s problem and this one.
are extremely similar, and the two concerns do appear related, however looking.
at his analysis and at mine I see no reason the responses should.
have similar types. I require to consider this more.)