Exponential-family random graph models for valued networks

From MaRDI portal
Publication:107263

DOI10.1214/12-EJS696zbMATH Open1264.91105arXiv1101.1359WikidataQ37661129 ScholiaQ37661129MaRDI QIDQ107263FDOQ107263


Authors: Pavel N. Krivitsky Edit this on Wikidata


Publication date: 1 January 2012

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1101.1359




Recommendations




Cites Work


Cited In (37)

Uses Software





This page was built for publication: Exponential-family random graph models for valued networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q107263)