Respondent-driven sampling on sparse Erdös-Rényi graphs

DOI10.1007/S40306-023-00510-8MaRDI QIDQ6081631zbMATH OpenFDO

Authors Anthony Cousien, Jean-Stéphane Dhersin, Viet Chi Tran, Thi Phuong Thuy Vo

Publication date 26 October 2023

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.16306

zbMATH Keywords

chain-referral surveyrandom graphrandom walk explorationrespondent-driven sampling

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Functional limit theorems; invariance principles (60F17) 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)

Abstract: We study the exploration of an Erd"os-R'enyi random graph by a respondent-driven sampling method, where discovered vertices reveal their neighbours. Some of them receive coupons to reveal in their turn their own neighbourhood. This leads to the study of a Markov chain on the random graph that we study. For sparse Erd"os-R'enyi graphs of large sizes, this process correctly renormalized converges to the solution of a deterministic curve, solution of a system of ODEs absorbed on the abscissa axis. The associated fluctuation process is also studied, providing a functional central limit theorem, with a Gaussian limiting process. Simulations and numerical computation illustrate the study.

Cites work

• Asymptotic normality of the size of the giant component via a random walk
• Brownian motion martingales and stochastic calculus
• Central limit theorems for network driven sampling
• Chain-referral sampling on stochastic block models
• Community detection and stochastic block models
• Concentration inequalities and model selection. Ecole d'Eté de Probabilités de Saint-Flour XXXIII -- 2003.
• Estimating hidden population size using respondent-driven sampling data
• Hidden population size estimation from respondent-driven sampling: a network approach
• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 4034749 (Why is no real title available?)
• scientific article; zbMATH DE number 3662294 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• Improved inference for respondent-driven sampling data with application to HIV prevalence estimation
• Limiting shape of the depth first search tree in an Erdős-Rényi graph
• On the Skorokhod topology
• Random graphs and complex networks. Volume 1
• Random graphs.
• Semimartingales: A course on stochastic processes
• Snowball Sampling
• The phase transition in the configuration model

Cited in

(1)

• Efficient respondents selection for biased survey using homophily-high social relation graph

This page was built for publication: Respondent-driven sampling on sparse Erdös-Rényi graphs

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