On normal approximations of distributions in terms of dependency graphs (Q582681)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On normal approximations of distributions in terms of dependency graphs |
scientific article; zbMATH DE number 4131347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On normal approximations of distributions in terms of dependency graphs |
scientific article; zbMATH DE number 4131347 |
Statements
On normal approximations of distributions in terms of dependency graphs (English)
0 references
1989
0 references
The authors interpret the bounds on the error in the normal approximation of sums of independent random variables introduced by \textit{C. Stein} [Approximate computation of expectations. IMS-Lect. Notes (1986)] in terms of dependency graphs. In this manner they improve a central limit theorem of \textit{M. B. Petrovskaya} and \textit{A. M. Leontovich} [Theory Probab. Appl. 27, 815-825 (1982; Zbl 0559.60069)]. They also obtain bounds on the rate of convergence.
0 references
error in the normal approximation
0 references
central limit theorem
0 references
rate of convergence
0 references