Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-29T20:08:23.337Z Has data issue: false hasContentIssue false
  • English
  • Français

Random Graphs and the Strong Convergence of Bootstrap Means

Published online by Cambridge University Press:  06 November 2000

SÁNDOR CSÖRGŐ  and
WEI BIAO WU
SÁNDOR CSÖRGŐ
Affiliation:
Department of Statistics, University of Michigan, 4062 Frieze Building, Ann Arbor, MI 48109–1285, USA (e-mail: scsorgo@umich.edu, wbwu@umich.edu) Bolyai Institute, University of Szeged, Aradi vértanúk tere 1, H–6720 Szeged, Hungary (e-mail: csorgo@math.u-szeged.hu)
WEI BIAO WU
Affiliation:
Department of Statistics, University of Michigan, 4062 Frieze Building, Ann Arbor, MI 48109–1285, USA (e-mail: scsorgo@umich.edu, wbwu@umich.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

We consider graphs Gn generated by multisets [Iscr ]n with n random integers as elements, such that vertices of Gn are connected by edges if the elements of [Iscr ]n that the vertices represent are the same, and prove asymptotic results on the sparsity of edges connecting the different subgraphs Gn of the random graph generated by ∪∞n=1[Iscr ]n. These results are of independent interest and, for two models of the bootstrap, we also use them here to link almost sure and complete convergence of the corresponding bootstrap means and averages of related randomly chosen subsequences of a sequence of independent and identically distributed random variables with a finite mean. Complete convergence of these means and averages is then characterized in terms of a relationship between a moment condition on the bootstrapped sequence and the bootstrap sample size. While we also obtain new sufficient conditions for the almost sure convergence of bootstrap means, the approach taken here yields the first necessary conditions.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 9 , Issue 4 , July 2000 , pp. 315 - 347
Copyright
2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)