Dense graph limits under respondent-driven sampling

DOI10.1214/15-AAP1144zbMath1350.05151arXiv1312.4271OpenAlexW3106288085MaRDI QIDQ341610

Adrian Roellin, Siva R. Athreya

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

zbMATH Keywords

random graphergodicdense graph limitsrespondent driven sampling

Mathematics Subject Classification ID

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

Related Items (4)

Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022 ⋮ Graphon-valued stochastic processes from population genetics ⋮ Respondent-driven sampling and sparse graph convergence ⋮ Estimation of dense stochastic block models visited by random walks

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