A critical threshold for design effects in network sampling
bootstrapdesign effectGalton-Watson processMarkov propertynetworks and graphsrespondent driven sampling (RDS)
Applications of graph theory (05C90) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Sampling theory, sample surveys (62D05) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to biology and medical sciences; meta analysis (62P10) Social networks; opinion dynamics (91D30)
The author considers response-driven sampling (RDS) which is a popular technique employed by several national and international organizations to study hard-to-reach populations such as those in HIV research programs. Each participant with an incentive to join the study passes three (to five) referrals, assumed to be a random subset of friends and those that respond will form the first wave of the study. This process iterates until the required sample size is reached or the process discontinues due to non response. Thus RDS can be regarded as a stochastic process on the members of the social network. Though the Markovian model is found to be easily tractable analytically, in practice the estimates of parameters of interest have large variances due to the invalid assumptions. \par The present paper defines a Markov process on a graph \(G\), with node set \(V\) consisting of the set of participants and the edge set \(E\) consisting of the relation of friendship between persons $i$ and $j$ as an edge. This process is indexed by a rooted tree $\mathbb{T}$. For any node $\sigma\in\mathbb{T}$, denote by $\sigma'$ the node one step closer to the root. For each node $i\in G$, let $y(i)$ be a study variable of this node. The problem now is to estimate $\mu=(\sum_{i\in G}y(i))/N$. Under RDS, a closed form expression for $V_1=\mathrm{Var}. (\hat\mu)$ is derived. For an independent random sample $w_1,w_2,\dots, w_n\in G$, if $\hat\mu$ is computed and its variance is denoted by $V_2$, the Design Effect DE of $\hat\mu$ is given by $V_1/V_2$. Next, the asymptotic behaviour of DE for the Galton-Watson process is studied. It is further shown that under certain assumptions on the referral tree, the DE of network sampling has a critical threshold which is a function of the referral rate and the clustering structure in the social network involving $\lambda_2$, the second largest eigenvalue of the Markov transition matrix. It is then shown by resampling of nodes for Markovian model, bootstrap procedures allow computational comparisons with earlier methods in the literature.
- Novel sampling design for respondent-driven sampling
- Bias-variance and breadth-depth tradeoffs in respondent-driven sampling
- Central limit theorems for network driven sampling
- Unequal edge inclusion probabilities in link-tracing network sampling with implications for respondent-driven sampling
- The effect of differential recruitment, non-response and non-recruitment on estimators for respondent-driven sampling
- A critical threshold for design effects in network sampling
- Central limit theorems for network driven sampling
- Generalized least squares can overcome the critical threshold in respondent-driven sampling
- scientific article; zbMATH DE number 3410334 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Improved inference for respondent-driven sampling data with application to HIV prevalence estimation
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Markov chains indexed by trees
- Novel sampling design for respondent-driven sampling
- Spectral clustering and the high-dimensional stochastic blockmodel
- Novel sampling design for respondent-driven sampling
- Central limit theorems for network driven sampling
- 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
- Estimation of dense stochastic block models visited by random walks
- Edgeworth expansions for network moments
- Asymptotic seed bias in respondent-driven sampling
- Correcting for differential recruitment in respondent-driven sampling data using ego-network information
- Designs for estimating the treatment effect in networks with interference
- On the question of effective sample size in network modeling: an asymptotic inquiry
- Sampling on bipartite networks: a comparative analysis of eight crawling methods
- scientific article; zbMATH DE number 5524713 (Why is no real title available?)
- Generalized least squares can overcome the critical threshold in respondent-driven sampling
- Thirty Years of The Network Scale-up Method
- Link Prediction for Egocentrically Sampled Networks
- Network Regression and Supervised Centrality Estimation
- Knowledge-guided Bayesian biclustering model for omics data with noisy graphs
This page was built for publication: A critical threshold for design effects in network sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1731771)
