<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Sums of uniform random values</title>
	<atom:link href="http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/</link>
	<description>The blog of John D. Cook</description>
	<lastBuildDate>Sat, 11 Feb 2012 01:10:06 -0500</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Mark</title>
		<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/comment-page-1/#comment-100475</link>
		<dc:creator>Mark</dc:creator>
		<pubDate>Fri, 26 Aug 2011 19:39:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=1491#comment-100475</guid>
		<description>Personally, considering how very &quot;non-normal&quot; the uniform distribution is, I am always amazed how close to a normal we get summing just two uniforms (CLT requires n-&gt;infinity and n=2 is a long, long way from that)! 

I believe the sum (or possibly average) of n uniforms is sometimes called Bartlett&#039;s distribution but I have no reference for the origin of this name (likely because it follows Stigler&#039;s law).</description>
		<content:encoded><![CDATA[<p>Personally, considering how very &#8220;non-normal&#8221; the uniform distribution is, I am always amazed how close to a normal we get summing just two uniforms (CLT requires n-&gt;infinity and n=2 is a long, long way from that)! </p>
<p>I believe the sum (or possibly average) of n uniforms is sometimes called Bartlett&#8217;s distribution but I have no reference for the origin of this name (likely because it follows Stigler&#8217;s law).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Developer</title>
		<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/comment-page-1/#comment-73365</link>
		<dc:creator>Developer</dc:creator>
		<pubDate>Mon, 28 Mar 2011 08:18:35 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=1491#comment-73365</guid>
		<description>Hi John,
Could you provide a simple code e.g., Python code, to implement the given formula? I will understand much easier the concept then.
I had also difficulty in very first part while the rest was understandable!
&quot;Suppose you have uniform random samples from the interval [0, 1].&quot;
&gt;&gt;&gt; s = scipy.rand(k,n)
&quot;If you add a large number (k) of such samples together, the sum ...&quot;(????)
&gt;&gt;&gt; s1 = s.flatten()          #all samples to one big sample
or
&gt;&gt;&gt; s1 = scipy.sum(s)    #k sums
however none of the results above have normal distribution!
Thanks.
Developer</description>
		<content:encoded><![CDATA[<p>Hi John,<br />
Could you provide a simple code e.g., Python code, to implement the given formula? I will understand much easier the concept then.<br />
I had also difficulty in very first part while the rest was understandable!<br />
&#8220;Suppose you have uniform random samples from the interval [0, 1].&#8221;<br />
&gt;&gt;&gt; s = scipy.rand(k,n)<br />
&#8220;If you add a large number (k) of such samples together, the sum &#8230;&#8221;(????)<br />
&gt;&gt;&gt; s1 = s.flatten()          #all samples to one big sample<br />
or<br />
&gt;&gt;&gt; s1 = scipy.sum(s)    #k sums<br />
however none of the results above have normal distribution!<br />
Thanks.<br />
Developer</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/comment-page-1/#comment-28866</link>
		<dc:creator>John</dc:creator>
		<pubDate>Mon, 14 Dec 2009 21:53:31 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=1491#comment-28866</guid>
		<description>Tanvir, we may be talking about PDF versus CDF. In my blog post, I gave the PDF. Feller (page 285 of the third edition, problem 20) gives the CDF.</description>
		<content:encoded><![CDATA[<p>Tanvir, we may be talking about PDF versus CDF. In my blog post, I gave the PDF. Feller (page 285 of the third edition, problem 20) gives the CDF.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tanvir Zaman</title>
		<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/comment-page-1/#comment-28805</link>
		<dc:creator>Tanvir Zaman</dc:creator>
		<pubDate>Mon, 14 Dec 2009 04:29:42 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=1491#comment-28805</guid>
		<description>In Feller&#039;s book the expression has n! instead of (n-1)! and (x-k)^n instead of (x-k)^(n-1) 
Would you please explain why is this difference?</description>
		<content:encoded><![CDATA[<p>In Feller&#8217;s book the expression has n! instead of (n-1)! and (x-k)^n instead of (x-k)^(n-1)<br />
Would you please explain why is this difference?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: electronicresourceguy</title>
		<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/comment-page-1/#comment-17013</link>
		<dc:creator>electronicresourceguy</dc:creator>
		<pubDate>Wed, 06 May 2009 03:33:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=1491#comment-17013</guid>
		<description>What about the margins John?

The normal distribution still has value outside of -6 to 6, the sum of 12 uniform random variables does not. 
Considering that anything beyond a 6 standard deviation span of the normal is generally accepted to be insignificant, it probably does not matter.</description>
		<content:encoded><![CDATA[<p>What about the margins John?</p>
<p>The normal distribution still has value outside of -6 to 6, the sum of 12 uniform random variables does not.<br />
Considering that anything beyond a 6 standard deviation span of the normal is generally accepted to be insignificant, it probably does not matter.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: gappy</title>
		<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/comment-page-1/#comment-13267</link>
		<dc:creator>gappy</dc:creator>
		<pubDate>Fri, 13 Feb 2009 04:00:48 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=1491#comment-13267</guid>
		<description>John, 
just a couple of notes: Feller&#039;s classic for free is available on scribd.com I am not sure how it is possible that this and other good books are there, but they have been there for quite a while.

Second, it&#039;s interesting how all modern probability books (Durrett, Pollard, Kallenberg, even Billingsley) do not have such beautifully worked-out numerical examples.</description>
		<content:encoded><![CDATA[<p>John,<br />
just a couple of notes: Feller&#8217;s classic for free is available on scribd.com I am not sure how it is possible that this and other good books are there, but they have been there for quite a while.</p>
<p>Second, it&#8217;s interesting how all modern probability books (Durrett, Pollard, Kallenberg, even Billingsley) do not have such beautifully worked-out numerical examples.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John</title>
		<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/comment-page-1/#comment-13257</link>
		<dc:creator>John</dc:creator>
		<pubDate>Thu, 12 Feb 2009 22:31:27 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=1491#comment-13257</guid>
		<description>It&#039;s interesting to compare numerical error and programming error. Generating 12 uniform values is probably a few times more expensive than something like Marsaglia&#039;s ziggurat algorithm. On the other hand, the uniform average method is so simple, it&#039;s hard to imagine programming it incorrectly. A bug could more easily hide in code for Marsaglia&#039;s algorithm.</description>
		<content:encoded><![CDATA[<p>It&#8217;s interesting to compare numerical error and programming error. Generating 12 uniform values is probably a few times more expensive than something like Marsaglia&#8217;s ziggurat algorithm. On the other hand, the uniform average method is so simple, it&#8217;s hard to imagine programming it incorrectly. A bug could more easily hide in code for Marsaglia&#8217;s algorithm.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: John Venier</title>
		<link>http://www.johndcook.com/blog/2009/02/12/sums-of-uniform-random-values/comment-page-1/#comment-13252</link>
		<dc:creator>John Venier</dc:creator>
		<pubDate>Thu, 12 Feb 2009 21:38:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.johndcook.com/blog/?p=1491#comment-13252</guid>
		<description>Thanks for doing the math, John.  I was curious how good it was.  Sounds plenty good.  I think we (and I intentionally include myself) sometimes worry too much about the quality of PRNGs and approximations.  Fortunately these days it is not usually not much harder to make the best choice than it is to make a bad one; the real trick is knowing when your choice is bad and that there is a better alternative.  But if it looks like a Herculean task to get a slightly better PRNG we may do well to recall what was used (very successfully) in the Manhattan project.  But I digress.

In fact, I wrote a long comment and redacted almost all of it due to a bad case of digression to the mean.  The key consideration is the symmetry of the underlying distribution.  A few practical experiments are enlightening, and may well change your attitude about a lot of statistics.  There are many similar places in statistics where the practical seems at odds with the theory and especially the classical presentation of statistics.  I think this is a fascinating topic in its own right and have examined it quite a bit, but it is out of place here.</description>
		<content:encoded><![CDATA[<p>Thanks for doing the math, John.  I was curious how good it was.  Sounds plenty good.  I think we (and I intentionally include myself) sometimes worry too much about the quality of PRNGs and approximations.  Fortunately these days it is not usually not much harder to make the best choice than it is to make a bad one; the real trick is knowing when your choice is bad and that there is a better alternative.  But if it looks like a Herculean task to get a slightly better PRNG we may do well to recall what was used (very successfully) in the Manhattan project.  But I digress.</p>
<p>In fact, I wrote a long comment and redacted almost all of it due to a bad case of digression to the mean.  The key consideration is the symmetry of the underlying distribution.  A few practical experiments are enlightening, and may well change your attitude about a lot of statistics.  There are many similar places in statistics where the practical seems at odds with the theory and especially the classical presentation of statistics.  I think this is a fascinating topic in its own right and have examined it quite a bit, but it is out of place here.</p>
]]></content:encoded>
	</item>
</channel>
</rss>

<!-- Dynamic Page Served (once) in 0.468 seconds -->

