Adjusting for network size and composition effects in exponential-family random graph models

Abstract

Exponential-family random graph models provide a principled way to model and simulate features common in human social networks, such as propensities for homophily and friend-of-a-friend triad closure. We show that, without adjustment, ERGMs preserve density as network size increases. Density invariance is often not appropriate for social networks. We suggest a simple modification based on an offset which instead preserves the mean degree and accommodates changes in network composition asymptotically. We demonstrate that this approach allows ERGMs to be applied to the important situation of egocentrically sampled data. We analyze data from the National Health and Social Life Survey. © 2011 Elsevier B.V.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,628

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Playing with networks: how economists explain. [REVIEW]Caterina Marchionni - 2013 - European Journal for Philosophy of Science 3 (3):331-352.
Random generations of the countable random graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
Social network size in humans.R. A. Hill & R. I. M. Dunbar - 2003 - Human Nature 14 (1):53-72.

Analytics

Added to PP
2017-06-02

Downloads
3 (#1,706,939)

6 months
1 (#1,463,894)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michael Morris
University of Sussex

References found in this work

No references found.

Add more references