Respondent-driven sampling and sparse graph convergence

Article Type

Research Article

Publication Title

Electronic Communications in Probability

Abstract

We consider a particular respondent-driven sampling procedure governed by a graphon. Using 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 converges to the governing graphon in the cut-metric. The tools used are a concentration inequality for Markov chains and the Stein-Chen method.

DOI

10.1214/17-ECP103

Publication Date

1-1-2018

Comments

All Open Access, Gold, Green

This document is currently not available here.

Share

COinS