title: Statistical inference for valued-edge networks: the generalized exponential random graph model.
abstract: Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks based on both endogenous and exogenous factors, exponential random graph models are a ubiquitous means of analysis. However, they are limited by an inability to model networks with valued edges. We address this problem by introducing a class of generalized exponential random graph models capable of modeling networks whose edges have continuous values (bounded or unbounded), thus greatly expanding the scope of networks applied researchers can subject to statistical analysis.
authors.affiliation: Department of Political Science, University of Massachusetts Amherst, Amherst, Massachusetts, United States of America. desmarais@polsci.umass.edu
authors.forename: Bruce A
authors.initials: BA
authors.lastname: Desmarais
authors.forename: Skyler J
authors.initials: SJ
authors.lastname: Cranmer
mesh_terms: D000465:Algorithms; D015233:Models, Statistical