Network Sampling with Memory
Identifieur interne : 001D44 ( Main/Merge ); précédent : 001D43; suivant : 001D45Network Sampling with Memory
Auteurs : Ted Mouw [États-Unis] ; Ashton M. Verdery [États-Unis]Source :
- Sociological Methodology [ 0081-1750 ] ; 2012.
Abstract
Techniques for sampling from networks have grown into an important area of research across several fields. For sociologists, the possibility of sampling from a network is appealing for two reasons: (1) A network sample can yield substantively interesting data about network structures and social interactions, and (2) it is useful in situations in which study populations are difficult or impossible to survey with traditional sampling approaches because of the lack of a sampling frame. Despite its appeal, methodological concerns about the precision and accuracy of network-based sampling methods remain. In particular, recent research has shown that sampling from a network using a random walk–based approach such as respondent-driven sampling (RDS) can result in a high design effect (DE): the ratio of the sampling variance to the sampling variance of simple random sampling (SRS). A high DE means that more cases must be collected to achieve the same level of precision as SRS. In this article, we propose an alternative strategy, network sampling with memory (NSM), which collects network data from respondents to reduce DEs and, correspondingly, the number of interviews needed to achieve a given level of statistical power. NSM combines a “list” mode, in which all individuals on the revealed network list are sampled with the same cumulative probability, with a “search” mode, which gives priority to bridge nodes connecting the current sample to unexplored parts of the network. We test the relative efficiency of NSM compared with RDS and SRS on 162 school and university networks from the National Longitudinal Study of Adolescent Health and Facebook that range in size from 110 to 16,278 nodes. The results show that the average DE for NSM on these 162 networks is 1.16, which is very close to the efficiency of a simple random sample (DE = 1) and 98.5 percent lower than the average DE we observed for RDS.
Url:
DOI: 10.1177/0081175012461248
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000C61
- to stream Istex, to step Curation: 000C53
- to stream Istex, to step Checkpoint: 000314
Links to Exploration step
ISTEX:357AD54004C3D29333D69CEED07D3254D9F28E5BLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Network Sampling with Memory</title><author><name sortKey="Mouw, Ted" sort="Mouw, Ted" uniqKey="Mouw T" first="Ted" last="Mouw">Ted Mouw</name></author><author><name sortKey="Verdery, Ashton M" sort="Verdery, Ashton M" uniqKey="Verdery A" first="Ashton M." last="Verdery">Ashton M. Verdery</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:357AD54004C3D29333D69CEED07D3254D9F28E5B</idno><date when="2012" year="2012">2012</date><idno type="doi">10.1177/0081175012461248</idno><idno type="url">https://api.istex.fr/ark:/67375/M70-JGMDSDSS-6/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000C61</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000C61</idno><idno type="wicri:Area/Istex/Curation">000C53</idno><idno type="wicri:Area/Istex/Checkpoint">000314</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000314</idno><idno type="wicri:doubleKey">0081-1750:2012:Mouw T:network:sampling:with</idno><idno type="wicri:Area/Main/Merge">001D44</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Network Sampling with Memory</title><author><name sortKey="Mouw, Ted" sort="Mouw, Ted" uniqKey="Mouw T" first="Ted" last="Mouw">Ted Mouw</name><affiliation><wicri:noCountry code="syntax">???</wicri:noCountry></affiliation><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>1University of North Carolina at Chapel Hill</wicri:regionArea></affiliation></author><author><name sortKey="Verdery, Ashton M" sort="Verdery, Ashton M" uniqKey="Verdery A" first="Ashton M." last="Verdery">Ashton M. Verdery</name><affiliation><wicri:noCountry code="syntax">???</wicri:noCountry></affiliation><affiliation wicri:level="1"><country xml:lang="fr">États-Unis</country><wicri:regionArea>1University of North Carolina at Chapel Hill</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="j">Sociological Methodology</title><idno type="ISSN">0081-1750</idno><idno type="eISSN">1467-9531</idno><imprint><publisher>SAGE Publications</publisher><pubPlace>Sage CA: Los Angeles, CA</pubPlace><date type="published" when="2012">2012</date><biblScope unit="volume">42</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="206">206</biblScope><biblScope unit="page" to="256">256</biblScope></imprint><idno type="ISSN">0081-1750</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0081-1750</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract">Techniques for sampling from networks have grown into an important area of research across several fields. For sociologists, the possibility of sampling from a network is appealing for two reasons: (1) A network sample can yield substantively interesting data about network structures and social interactions, and (2) it is useful in situations in which study populations are difficult or impossible to survey with traditional sampling approaches because of the lack of a sampling frame. Despite its appeal, methodological concerns about the precision and accuracy of network-based sampling methods remain. In particular, recent research has shown that sampling from a network using a random walk–based approach such as respondent-driven sampling (RDS) can result in a high design effect (DE): the ratio of the sampling variance to the sampling variance of simple random sampling (SRS). A high DE means that more cases must be collected to achieve the same level of precision as SRS. In this article, we propose an alternative strategy, network sampling with memory (NSM), which collects network data from respondents to reduce DEs and, correspondingly, the number of interviews needed to achieve a given level of statistical power. NSM combines a “list” mode, in which all individuals on the revealed network list are sampled with the same cumulative probability, with a “search” mode, which gives priority to bridge nodes connecting the current sample to unexplored parts of the network. We test the relative efficiency of NSM compared with RDS and SRS on 162 school and university networks from the National Longitudinal Study of Adolescent Health and Facebook that range in size from 110 to 16,278 nodes. The results show that the average DE for NSM on these 162 networks is 1.16, which is very close to the efficiency of a simple random sample (DE = 1) and 98.5 percent lower than the average DE we observed for RDS.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001D44 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001D44 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:357AD54004C3D29333D69CEED07D3254D9F28E5B
|texte= Network Sampling with Memory
}}
| This area was generated with Dilib version V0.6.33. |  |