𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Note on the Rate of Convergence of the Bootstrap

✍ Scribed by G. Dikta


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
74 KB
Volume
75
Category
Article
ISSN
0021-9045

No coin nor oath required. For personal study only.

✦ Synopsis


It is shown that the bootstrap approximation of the standardized sample mean for the operator introduced by Trotter improves the normal approximation. c 1993 Academic Press, Inc.


πŸ“œ SIMILAR VOLUMES


On the Rate of Multivariate Poisson Conv
✍ Bero Roos πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 141 KB

The distribution of the sum of independent nonidentically distributed Bernoulli random vectors in R k is approximated by a multivariate Poisson distribution. By using a multivariate adaption of Kerstan's (1964, Z. Wahrsch. verw. Gebiete 2, 173 179) method, we prove a conjecture of Barbour (1988, J.

A NOTE ON THE CONVERGENCE OF THE DIRECT
✍ P. Juhl πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 236 KB

Convergence results for acoustic boundary element formulations have mainly been presented in the mathematical and numerical literature, and the results do not seem to be widely known among acoustic engineers. In this paper, an overview of some of the literature dealing with convergence of boundary e

A Note on the Convergence of Integral Fu
✍ F. Liese; W. Schmidt πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 268 KB

For a diffusion type process dX, = d w + a(t, X) dt and a sequence (f,) of nonnegative functions necessary and sufficient conditions to the f, are established which guarantee the as. convergence of fn(X,) dt to zero. This result is applied to derive simple necessary and sufficient conditions for the

Effects of Asynchronism on the Convergen
✍ Aydin Üresin; Michel Dubois πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 392 KB

In multiprocessor systems, iterative algorithms can be implemented synchronously or asynchronously. Unfortunately, few guidelines exist to make a choice. In this paper, we compare the execution times of an asynchronous iterative algorithm and of its synchronous counterpart. Synchronization overhead