Exponential-Family Random Graph Models for Valued Networks

Details Exponential-Family Random Graph Models for Valued Networks Exponential-Family Random Graph Models for Valued Networks

2011-01-07

arxiv.org/abs/1101.1359v2

Statistics

Methodology

42 pages, including 2 appendixes (3 pages total), 5 figures, 2 tables, 1 algorithm listing; a substantial revision and reorgan

Scientific paper

Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for homophily, mutuality, and friend-of-a-friend triad closure, through choice of model terms (sufficient statistics). However, those ERGMs modeling the more complex features have, to date, been limited to binary data: presence or absence of ties. Thus, analysis of valued networks, such as those where counts, measurements, or ranks are observed, has necessitated dichotomizing them, losing information and introducing biases. In this work, we generalize ERGMs to valued networks. Focusing on modeling counts, we formulate an ERGM for networks whose ties are counts and discuss issues that arise when moving beyond the binary case. We introduce model terms that generalize and model common social network features for such data and apply these methods to a network dataset whose values are counts of interactions.

Affiliated with

Also associated with

No associations

Rating

Exponential-Family Random Graph Models for Valued Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exponential-Family Random Graph Models for Valued Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exponential-Family Random Graph Models for Valued Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-483415