vix.ing · top · new · best · stats

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

2020/07/28 by Emily Breza, Arun G. Chandrasekhar, Tyler H. McCormick +1 · 110 citations
Engineering · Mathematics · Physics and Astronomy · Social Sciences · #Complex Network Analysis Techniques #Complex network #Computer science #Data mining #Data science #Econometrics #Engineering #Field (mathematics) #Graph #Limiting #Mathematics #Network analysis #Network science #Node (physics) #Relational database #Replicate #Sampling (signal processing) #Social Capital and Networks #Social network (sociolinguistics) #Statistics #Theoretical computer science

paper · open access · doi:10.1257/aer.20170861

published in American Economic Review 110(8), 2454-2484 (American Economic Association)

openalex publication_date 2020/07/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

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.

Citations

Cited by

Related