Respondent-driven sampling and sparse graph convergence

DOI10.1214/17-ECP103MaRDI QIDQ1748549zbMATH OpenOpenAlexFDO

Authors Siva R. Athreya, Adrian Röllin

Publication date 11 May 2018

Published in Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.02731, https://projecteuclid.org/euclid.ecp/1517626933

zbMATH Keywords

random graphrespondent-driven samplingdense graph limitssparse-graph limits

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Central limit and other weak theorems (60F05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Abstract: We consider a particular respondent-driven sampling procedure governed by a graphon. By a specific clumping procedure of the sampled vertices we construct a sequence of sparse graphs. If the sequence of the vertex-sets is stationary then the sequence of sparse graphs converge to the governing graphon in the cut-metric. The tools used are concentration inequality for Markov chains and the Stein-Chen method.

Recommendations

• Dense graph limits under respondent-driven sampling
• Central limit theorems for network driven sampling
• Sampling perspectives on sparse exchangeable graphs
• Novel sampling design for respondent-driven sampling
• Asymptotic seed bias in respondent-driven sampling

Cites work

• scientific article; zbMATH DE number 52632 (Why is no real title available?)
• An \(L^{p}\) theory of sparse graph convergence. II: LD convergence, quotients and right convergence
• Concentration inequalities for Markov chains by Marton couplings and spectral methods
• Dense graph limits under respondent-driven sampling
• Markov Chains and Stochastic Stability
• Metrics for sparse graphs
• Multivariate normal approximations by Stein's method and size bias couplings

Cited in

(5)

• Sampling perspectives on sparse exchangeable graphs
• Chain-referral sampling on stochastic block models
• Efficient respondents selection for biased survey using homophily-high social relation graph
• Dense graph limits under respondent-driven sampling
• Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022

This page was built for publication: Respondent-driven sampling and sparse graph convergence

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