The $m(n)$ out of $k(n)$ bootstrap for partial sums of St. Petersburg type games
Authors:
Open Access
- 1 January 2013
- journal article
- research article
- Published by Institute of Mathematical Statistics in Electronic Communications in Probability
- Vol. 18 (none) , 1-10-10
Abstract
This paper illustrates that the bootstrap of a partial sum given by i.i.d. copies of a random variable $X_1$ has to be dealt with care in general. It turns out that in various cases a whole spectrum of different limit laws of the $m(n)$ out of $k(n)$ bootstrap can be obtained for different choices of $m(n)/k(n) -> 0$ whenever $X_1$ does not lie in the domain of attraction of a stable law. As a concrete example we study bootstrap limit laws for the cumulated gain sequence of repeated St. Petersburg games. It is shown that here a continuum of different semi-stable bootstrap limit laws occurs.
Keywords
This publication has 18 references indexed in Scilit:
- Probabilistic approach to limit theorems for the St. Petersburg GameActa Scientiarum Mathematicarum, 2010
- The Accuracy of Merging Approximation in Generalized St. Petersburg GamesJournal of Theoretical Probability, 2009
- Resampling schemes with low resampling intensity and their applications in testing hypothesesJournal of Statistical Planning and Inference, 2009
- Merging asymptotic expansions for cooperative gamblers in generalized St. Petersburg gamesActa Mathematica Hungarica, 2008
- On the low intensity bootstrap for triangular arrays of independent identically distributed random variablesTEST, 2007
- The Weighted Bootstrap Mean for Heavy-Tailed DistributionsJournal of Theoretical Probability, 2000
- The asymptotic distribution of the bootstrap sample mean of an infinitesimal arrayAnnales de l'Institut Henri Poincaré, Probabilités et Statistiques, 1998
- When Does Bootstrap Work?1992
- Limit Theorems for the Petersburg Game1991
- A note on proving that the (modified) bootstrap worksCommunications in Statistics - Theory and Methods, 1986