Cross Validated Asked by Mattjosh on October 26, 2020

I am trying to solve problem 2.5 from the Efron/Tibshirani book, *An Introduction to the Bootstrap* (page 16).

The problem asks to show that by applying the weak law of large numbers, the bootstrap estimate of standard error

$hat{se}_{boot} = left{ sum_{b=1}^{B} [s(x^{*b}) – s(cdot)]^2 / (B-1) right}^{1/2}$

approaches

$left{ sum_{i=1}^{n} (x_i – bar{x})^2 / n^2 right}^{1/2} $

when the number of bootstrap samples, $B$, goes to infinity.

$x_i$ are the elements of the original sample which is of size $n$, $x^{*b}$ is the b-th bootstrap sample, $s(cdot) = sum_{b=1}^B s(x^{*b})/B$, and $s(x)$ is the mean $bar{x}$.

I can see empirically that this seems to be true, though I wonder how the proof is performed analytically.

Get help from others!

Recent Questions

- How can I transform graph image into a tikzpicture LaTeX code?
- How Do I Get The Ifruit App Off Of Gta 5 / Grand Theft Auto 5
- Iv’e designed a space elevator using a series of lasers. do you know anybody i could submit the designs too that could manufacture the concept and put it to use
- Need help finding a book. Female OP protagonist, magic
- Why is the WWF pending games (“Your turn”) area replaced w/ a column of “Bonus & Reward”gift boxes?

Recent Answers

- haakon.io on Why fry rice before boiling?
- Jon Church on Why fry rice before boiling?
- Joshua Engel on Why fry rice before boiling?
- Peter Machado on Why fry rice before boiling?
- Lex on Does Google Analytics track 404 page responses as valid page views?

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP