IDEAS home Printed from https://ideas.repec.org/a/cup/netsci/v2y2014i02p298-301_00.html
   My bibliography  Save this article

Stickiness of respondent-driven sampling recruitment chains

Author

Listed:
  • FISHER, JACOB C.
  • MERLI, M. GIOVANNA

Abstract

Respondent-driven sampling (RDS) is an increasingly popular chain-referral sampling method. Although it has proved effective at generating samples of hard to reach populations—meaning populations for which sampling frames are not available because they are hidden or socially stigmatized like sex workers or injecting drug users—quickly and cost-effectively, the ease of collecting the sample comes with a cost: bias or inefficiency in the estimates of population parameters (Gile & Handcock, 2010; Goel & Salganik, 2010). One way that RDS can produce inefficient estimates is if one or more of the recruitment chains gets stuck among members of a cohesive subpopulation, preventing the RDS sampling process from exploring other areas of the network. If that happens, members of the population subgroup recruit one another repeatedly, leading to an increase in sample size without increasing the diversity of the sample. This type of stickiness is particularly likely when hidden populations are stratified, and the stratified groups are organized into venues that provide opportunities to recruit other members of the same stratum. Female sex workers (FSW) in China, who are stratified into tiers of sex work that are correlated with marital status, age, and risk behaviors, are a prime example (Merli et al., 2014; Yamanis et al., 2013). Chinese FSW recruit clients from venues such as karaoke bars, massage parlors, or street corners. At larger venues, sex workers who participate in an RDS study might recruit other members of the same venue into the study at a higher rate than expected, leading to inefficient estimates. In short, the chain could get stuck in a venue.

Suggested Citation

  • Fisher, Jacob C. & Merli, M. Giovanna, 2014. "Stickiness of respondent-driven sampling recruitment chains," Network Science, Cambridge University Press, vol. 2(2), pages 298-301, August.
  • Handle: RePEc:cup:netsci:v:2:y:2014:i:02:p:298-301_00
    as

    Download full text from publisher

    File URL: https://www.cambridge.org/core/product/identifier/S2050124214000162/type/journal_article
    File Function: link to article abstract page
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cup:netsci:v:2:y:2014:i:02:p:298-301_00. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Kirk Stebbing (email available below). General contact details of provider: https://www.cambridge.org/nws .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.