Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-08T04:49:52.919Z Has data issue: false hasContentIssue false

Measuring networks in the field

Published online by Cambridge University Press:  25 March 2019

Jennifer M. Larson*
Affiliation:
Political Science Department, Vanderbilt University, College of Arts and Science, Nashville, TN US
Janet I. Lewis
Affiliation:
Political Science Department, US Naval Academy, Annapolis, MD US
*
*Corresponding author. E-mail: larson.jenn@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Measuring networks in the field—usually by asking individuals systematically about their networks–entails complex design choices, with large consequences for the resulting data. Because observations in a network are interconnected, well-established practices from non-network survey settings can lead researchers astray. Despite the increasing focus on networks in political science, little guidance is available for researchers facing high-stakes decisions when designing a study to elicit networks. This paper serves as a practical guide. It offers a simple framework for constructing a network theory, illuminates tradeoffs like measuring more nodes versus more ties per node or asking for names versus selections from a list, and proposes a new technique for cleaning relational data.

Information

Type
Original Articles
Copyright
Copyright © The European Political Science Association 2019 
Figure 0

Table 1. Constructing a Network Theory

Figure 1

Figure 1. The more the network attributes of interest depend on interconnections throughout a network, the more precisely a network needs to be measured. Studies interested in network features like centrality, path lengths, transitivity, reciprocated ties, etc. suffer from small samples.

Figure 2

Figure 2. Consequences of random sampling from four real social networks at different sample sizes for six network attributes. Figures display the average Kendall rank correlation between nodes' true network feature and the observed network feature when a sample of a certain size is drawn. Networks A and B are undirected social networks from Banerjee et al. (2013), and Networks C and D are directed social networks from Larson and Lewis (2017). On average, small samples perform especially badly for more demanding structural features.

Supplementary material: PDF

Larson and Lewis supplementary material

Larson and Lewis supplementary material 1

Download Larson and Lewis supplementary material(PDF)
PDF 39.9 MB
Supplementary material: Link

Larson and Lewis Dataset

Link