A short proof of Motoo's combinatorial central limit theorem using Stein's method
Article
Received:
Revised:
- 103 Downloads
- 3 Citations
Summary
A new proof of Motoo's combinatorial central limit theorem (see Motoo 1957) is given using a method of Stein (1972) and a combinatorial method of Bolthausen (1984). This proof is shorter than Motoo's and other wellknown proofs (see e.g. Hájek 1961).
Keywords
Stochastic Process Stein Probability Theory Limit Theorem Statistical Theory
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Bolthausen, E.: An estimate of the remainder in a combinatorial central limit theorem. Z. Wahrscheinlichkeitstheor. Verw. Geb. 66, 379–386 (1984)Google Scholar
- 2.Chen, L.H.Y.: Two central limit problems for dependent random variables. Z. Wahrscheinlichkeitstheor. Verw. Geb. 43, 223–243 (1978)Google Scholar
- 3.Hájek, J.: Some extensions of the Wald-Wolfowitz-Noether theorem. Ann. Math. Statist. 32, 506–523 (1961)Google Scholar
- 4.Ho, S.T., Chen, L.H.Y.: An L p bound for the remainder in a combinational central limit theorem. Ann. Probab. 6, 231–249 (1978)Google Scholar
- 5.Hoeffding, W.: A combinatorial central limit theorem. Ann. Math. Statist. 22, 558–566 (1951)Google Scholar
- 6.Motoo, M.: On the Hoeffding's combinatorial central limit theorem. Ann. Inst. Stat. Math. 8, 145–154 (1957)Google Scholar
- 7.Stein, Ch.: A bound for the error in the normal approximation to the distribution of a sum of dependent random variables. Proc. Sixth Berkeley Sympos. Math. Statist. Probab. 2, 583–602 (1972)Google Scholar
Copyright information
© Springer-Verlag 1988