An estimate of the remainder in a combinatorial central limit theorem (Q3676893)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3897922
Language Label Description Also known as
default for all languages
No label defined
    English
    An estimate of the remainder in a combinatorial central limit theorem
    scientific article; zbMATH DE number 3897922

      Statements

      An estimate of the remainder in a combinatorial central limit theorem (English)
      0 references
      0 references
      1984
      0 references
      Stein method
      0 references
      Berry-Esseen theorem
      0 references
      rank statistics
      0 references
      The author describes a surprisingly short inductive version of the so- called Stein method to prove the Berry-Esseen theorem for i.i.d. random variables. The same methods (with some modifications) are applied to prove the Berry-Esseen theorem for general linear rank statistics (of type \(\sum^{n}_{i=1}a_{i\pi (i)}\), \(\pi\) random permutation) under optimal conditions. This clever inductive approach yields a much shorter proof and more insight into the minimal conditions as previous Fourier- theoretic approaches as well as previous applications of Stein's method to this problem.
      0 references

      Identifiers