Respondent driven sampling and sparse graph convergence
Probability
2017-05-09 v1
Abstract
We consider a particular respondent-driven sampling procedure governed by a graphon. By a specific clumping procedure of the sampled vertices we construct a sequence of sparse graphs. If the sequence of the vertex-sets is stationary then the sequence of sparse graphs converge to the governing graphon in the cut-metric. The tools used are concentration inequality for Markov chains and the Stein-Chen method.
Keywords
Cite
@article{arxiv.1705.02731,
title = {Respondent driven sampling and sparse graph convergence},
author = {Siva Athreya and Adrian Röllin},
journal= {arXiv preprint arXiv:1705.02731},
year = {2017}
}
Comments
13 pages