TY - JOUR
T1 - Does homophily predict consensus times? Testing a model of network structure via a dynamic process
AU - Golub, Benjamin
AU - Jackson, Matthew O.
N1 - Funding Information:
3Add Health is a program project designed by J. Richard Udry, Peter S. Bearman, and Kathleen Mullan Harris, and funded by a grant P01-HD31921 from the National Institute of Child Health and Human Development, with cooperative funding from 17 other agencies. Persons interested in obtaining data files from Add Health should contact Add Health, Carolina Population Center, 123 W. Franklin Street, Chapel Hill, NC 27516-2524 ([email protected]).
Funding Information:
KEYWORDS: homophily, friendships, social networks, random graphs, inhomogeneous random graphs, spectral graph theory Author Notes: We are grateful to Andrea Galeotti and an anonymous referee for very helpful suggestions. Jackson gratefully acknowledges financial support from the NSF under grants SES-0961481 and SES-1155302. Golub gratefully acknowledges financial support from an NSF Graduate Research Fellowship. This article includes material that originally appeared in the working paper "How Homophily Affects Diffusion and Learning in Networks'' (arXiv:0811.4013v2).
PY - 2012/9
Y1 - 2012/9
N2 - We test theoretical results from Golub and Jackson (2012a), which are based on a random network model, regarding time to convergence of a learning/behavior-updating process. In particular, we see how well those theoretical results match the process when it is simulated on empirically observed high school friendship networks. This tests whether a parsimonious random network model mimics real-world networks with regard to predicting properties of a class of behavioral processes. It also tests whether our theoretical predictions for asymptotically large societies are accurate when applied to populations ranging from thirty to three thousand individuals. We find that the theoretical results account for more than half of the variation in convergence times on the real networks. We conclude that a simple multi-type random network model with types defined by simple observable attributes (age, sex, race) captures aspects of real networks that are relevant for a class of iterated updating processes.
AB - We test theoretical results from Golub and Jackson (2012a), which are based on a random network model, regarding time to convergence of a learning/behavior-updating process. In particular, we see how well those theoretical results match the process when it is simulated on empirically observed high school friendship networks. This tests whether a parsimonious random network model mimics real-world networks with regard to predicting properties of a class of behavioral processes. It also tests whether our theoretical predictions for asymptotically large societies are accurate when applied to populations ranging from thirty to three thousand individuals. We find that the theoretical results account for more than half of the variation in convergence times on the real networks. We conclude that a simple multi-type random network model with types defined by simple observable attributes (age, sex, race) captures aspects of real networks that are relevant for a class of iterated updating processes.
KW - Friendships
KW - Homophily
KW - Inhomogeneous random graphs
KW - Random graphs
KW - Social networks
KW - Spectral graph theory
UR - http://www.scopus.com/inward/record.url?scp=84870337929&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84870337929&partnerID=8YFLogxK
U2 - 10.1515/1446-9022.1367
DO - 10.1515/1446-9022.1367
M3 - Article
AN - SCOPUS:84870337929
SN - 1446-9022
VL - 11
JO - Review of Network Economics
JF - Review of Network Economics
IS - 3
M1 - 9
ER -