REVIEW 1 cited by
Deriving the Central Limit Theorem from the De Moivre-Laplace Theorem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The de Moivre-Laplace theorem is a special case of the central limit theorem for Bernoulli random variables, and can be proved by direct computation. We deduce the central limit theorem for any random variable with finite variance from the de Moivre-Laplace theorem. Our proof does not use advanced notions such as characteristic functions, the Brownian motion, or stopping times.
Forward citations
Cited by 1 Pith paper
-
A random walk among random graphs
These lecture notes provide a pedagogical tour of random walk and random graph theory, covering standard results without claiming new research advances.
Discussion (0). Continue with ORCID to comment.