Respondent-driven sampling and sparse graph convergence

DOI10.1214/17-ECP103zbMath1392.05097arXiv1705.02731OpenAlexW2964197895MaRDI QIDQ1748549

Siva R. Athreya, Adrian Roellin

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

zbMATH Keywords

random graphrespondent-driven samplingdense graph limitssparse-graph limits

Mathematics Subject Classification ID

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

Related Items (2)

Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022 ⋮ Chain-referral sampling on stochastic block models

Cites Work

• Unnamed Item
• Dense graph limits under respondent-driven sampling
• 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
• Markov Chains and Stochastic Stability
• Metrics for sparse graphs
• Multivariate normal approximations by Stein's method and size bias couplings

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