Please use this identifier to cite or link to this item:
https://doi.org/10.1214/17-ECP103
| Title: | Respondent-driven sampling and sparse graph convergence | Authors: | Athreya, S. Roellin, A. |
Keywords: | Dense graph limits Random graph Respondent-driven sampling Sparse-graph limits |
Issue Date: | 2018 | Publisher: | University of Washington | Citation: | Athreya, S., Roellin, A. (2018). Respondent-driven sampling and sparse graph convergence. Electronic Communications in Probability 23 : 3. ScholarBank@NUS Repository. https://doi.org/10.1214/17-ECP103 | Rights: | Attribution 4.0 International | 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. © 2018, University of Washington. All rights reserved. | Source Title: | Electronic Communications in Probability | URI: | https://scholarbank.nus.edu.sg/handle/10635/214066 | ISSN: | 1083-589X | DOI: | 10.1214/17-ECP103 | Rights: | Attribution 4.0 International |
| Appears in Collections: | Staff Publications Elements |
Show full item record
Files in This Item:
| File | Description | Size | Format | Access Settings | Version | |
|---|---|---|---|---|---|---|
| 10_1214_17-ECP103.pdf | 237 kB | Adobe PDF | OPEN | None | View/Download |
This item is licensed under a Creative Commons License
