文章基本信息

标题：Respondent-Driven Sampling and Sparse Graph Convergence
本地全文：下载
作者：Siva Athreya ; Adrian Röllin
期刊名称：Electronic Communications in Probability
印刷版ISSN：1083-589X
出版年度：2018
卷号：23
DOI：10.1214/17-ECP103
语种：English
出版社：Electronic Communications in Probability
摘要：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.