Dense graph limits under respondent-driven sampling

Article Type

Research Article

Publication Title

Annals of Applied Probability

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.

First Page

2193

Last Page

2210

DOI

10.1214/15-AAP1144

Publication Date

8-1-2016

Comments

Open Access; Bronze Open Access; Green Open Access

Share

COinS