Dense graph limits under respondent-driven sampling
Probability
2016-09-29 v3 Statistics Theory
Statistics Theory
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.
Keywords
Cite
@article{arxiv.1312.4271,
title = {Dense graph limits under respondent-driven sampling},
author = {Siva Athreya and Adrian Röllin},
journal= {arXiv preprint arXiv:1312.4271},
year = {2016}
}
Comments
Published at http://dx.doi.org/10.1214/15-AAP1144 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)