TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

An Introduction to the Central Limit Theorem

97 pointsby StylifyYourBlogover 10 years ago

8 comments

jordighover 10 years ago
&gt; Often referred to as the cornerstone of statistics<p>Well... often referred to as the central theorem of statistics. Each time you say its name. What&#x27;s central is the theorem, not the limit. It was Polya who first called it that, &quot;zentraler Grenzwertsatz&quot;.<p>&gt; Why the Central Limit Theorem Works<p>Well... I don&#x27;t think that&#x27;s really an explanation at all of why e^(-x^2&#x2F;2) is such a privileged function. Why would any distribution converge to a normal distribution?<p>It essentially boils down to the Fourier transform. When you take the Fourier transform of the sample means, if you ignore all but the quadratic terms (there are no linear terms if you centralise to mean 0 and variance 1), you get the exponential limit (1 - t^2&#x2F;2n)^n. That&#x27;s the Gaussian, which is its own Fourier transform.<p><a href="https://en.wikipedia.org/wiki/Central_limit_theorem#Proof_of_classical_CLT" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Central_limit_theorem#Proof_of...</a><p>In other words, because the Gaussian is its own Fourier transform, sample means converge to the Gaussian.
评论 #9041830 未加载
评论 #9040273 未加载
评论 #9040644 未加载
评论 #9050614 未加载
pspencerover 10 years ago
I always liked this visual representation of the central limit theorem: <a href="http://blog.vctr.me/posts/central-limit-theorem.html" rel="nofollow">http:&#x2F;&#x2F;blog.vctr.me&#x2F;posts&#x2F;central-limit-theorem.html</a>. There is a faster one here (I think written in R): <a href="http://vis.supstat.com/2013/04/bean-machine/" rel="nofollow">http:&#x2F;&#x2F;vis.supstat.com&#x2F;2013&#x2F;04&#x2F;bean-machine&#x2F;</a><p>These are computer simulations of Galton boxes: <a href="http://en.wikipedia.org/wiki/Bean_machine" rel="nofollow">http:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Bean_machine</a>
评论 #9043490 未加载
评论 #9041613 未加载
bkcooperover 10 years ago
I think the first half of the article showing how this works with a given sample distribution is pretty good. I don&#x27;t think it&#x27;s really doing much to build intuition at the end, though.<p>It&#x27;s also worth pointing out that there are distributions for which the central limit theorem doesn&#x27;t hold (e.g. the sum of samples from a Lorentzian distribution will again be Lorentzian, not Gaussian.)
评论 #9041857 未加载
评论 #9040392 未加载
rm999over 10 years ago
I have a series of basic questions I include in any data science interview, and one is &quot;please describe what the central limit theorem says in simple, high-level terms&quot;. It&#x27;s absolutely amazing how many people who have great credentials can&#x27;t do this. I get a lot of &quot;any distribution becomes normal when you sample it enough&quot;. This is nonsensical and shows a lack of understanding of the theorem.<p>Please, if you claim to know stats, understand what the central limit theorem says. It&#x27;s a pretty incredible and useful theorem.
评论 #9041411 未加载
jhallenworldover 10 years ago
My introduction to the central limit theorem was that chained independent random processes tend to result in a Gaussian distribution. This is so general that one is surprised when one finds non-Gaussian distributions (canonical example: the stock market).<p>I attended a lecture by Mandelbrot (shortly before he died) where he spoke at length about this- take a look at stable distributions and the generalized central limit theorem.
评论 #9050643 未加载
giarcover 10 years ago
Is it not tradition to use n for sample size rather than N? N is typically population size (in my experience).
评论 #9044754 未加载
eliwjonesover 10 years ago
To me.. the core idea is that (given one chooses, over and over, from a bunch of independent and identically distributed events.):<p>There are more ways for everything to happen than there are ways for one thing to happen over and over.
willvarfarover 10 years ago
An interesting bit of trivia for computer history buffs:<p>Alan Turing independently discovered the Central Limit Theorem while still an undergrad in 1934.