Dense graph limits under respondent-driven sampling

DOI10.1214/15-AAP1144MaRDI QIDQ341610zbMATH OpenOpenAlexFDO

Authors Siva R. Athreya, Adrian Röllin

Publication date 16 November 2016

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.4271, https://projecteuclid.org/euclid.aoap/1472745456

zbMATH Keywords

random graphergodicdense graph limitsrespondent driven sampling

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Random graphs (graph-theoretic aspects) (05C80) Density (toughness, etc.) (05C42) Ergodic theorems, spectral theory, Markov operators (37A30) Ergodic theory of linear operators (47A35)

Abstract: We consider certain respondent-driven sampling procedures on dense graphs. We show that if the sequence of the vertex-sets is ergodic then the limiting graph can be expressed in terms of the original dense graph via a transformation related to the invariant measure of the ergodic sequence. For specific sampling procedures, we describe the transformation explicitly.

Recommendations

• Respondent-driven sampling and sparse graph convergence
• Central limit theorems for network driven sampling
• Sampling perspectives on sparse exchangeable graphs
• Limits of randomly grown graph sequences
• Limits of dense graph sequences

Cited in

(5)

• Graphon-valued stochastic processes from population genetics
• Respondent-driven sampling and sparse graph convergence
• Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022
• Estimation of dense stochastic block models visited by random walks
• Dense limit of the Dawid–Skene model for crowdsourcing and regions of sub-optimality of message passing algorithms

This page was built for publication: Dense graph limits under respondent-driven sampling

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