arrow
Return

Using Aggregated Relational Data to Feasibly Identify Network Structure without Network Data

delete2020-08-01
delete43
delete
OA
AI
E
Emily Breza *
A
Arun G. Chandrasekhar
M
McCormick, Tyler H.
P
Pan, Mengjie
DOI:10.1257/aer.20170861delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Social network data are often prohibitively expensive to collect, limiting empirical network research. We propose an inexpensive and feasible strategy for network elicitation using Aggregated Relational Data (ARD): responses to questions of the form how many of your links have trait k? Our method uses ARD to recover parameters of a network formation model, which permits sampling from a distribution over node- or graph-level statistics. We replicate the results of two field experiments that used network data and draw similar conclusions with ARD alone.
Keywords:
FINANCIAL NETWORKS
SOCIAL NETWORKS
ARRAYS
MODELS
LIMITS
RISK

Journal

American Economic Review cover
American Economic Review
IF:
11.6
Papers:
5.0K
Citations:
7.5W

Organization

H
Harvard University
Scholars:
26.5W
Papers: 22.0W
Citations: 28.7W
U
University of Washington
Scholars:
8.0W
Papers: 7.0W
Citations: 12.5W
S
Stanford University
Scholars:
9.6W
Papers: 8.2W
Citations: 17.0W
researcher View more organizations