Central limit theorems for network driven sampling

DOI10.1214/17-EJS1333MaRDI QIDQ1684170zbMATH OpenOpenAlexFDO

Authors Xiao Li, Karl Rohe

Publication date 8 December 2017

Published in Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.04704, https://projecteuclid.org/euclid.ejs/1512637351

zbMATH Keywords

central limit theoremrespondent-driven samplingstochastic blockmodel

Mathematics Subject Classification ID

Sample path properties (60G17) Sampling theory, sample surveys (62D05)

Abstract: Respondent-Driven Sampling is a popular technique for sampling hidden populations. This paper models Respondent-Driven Sampling as a Markov process indexed by a tree. Our main results show that the Volz-Heckathorn estimator is asymptotically normal below a critical threshold. The key technical difficulties stem from (i) the dependence between samples and (ii) the tree structure which characterizes the dependence. The theorems allow the growth rate of the tree to exceed one and suggest that this growth rate should not be too large. To illustrate the usefulness of these results beyond their obvious use, an example shows that in certain cases the sample average is preferable to inverse probability weighting. We provide a test statistic to distinguish between these two cases.

Recommendations

• A critical threshold for design effects in network sampling
• Novel sampling design for respondent-driven sampling
• Asymptotic seed bias in respondent-driven sampling
• Nonparametric identification for respondent-driven sampling
• Improved inference for respondent-driven sampling data with application to HIV prevalence estimation

Cited in

(9)

• A simulation-based framework for assessing the feasibility of respondent-driven sampling for estimating characteristics in populations of lesbian, gay and bisexual older adults
• A critical threshold for design effects in network sampling
• Respondent-driven sampling and sparse graph convergence
• Estimation of dense stochastic block models visited by random walks
• Asymptotic seed bias in respondent-driven sampling
• Correcting for differential recruitment in respondent-driven sampling data using ego-network information
• Dense graph limits under respondent-driven sampling
• Respondent-driven sampling on sparse Erdös-Rényi graphs
• Nonparametric identification for respondent-driven sampling

This page was built for publication: Central limit theorems for network driven sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1684170)