pith. sign in

arxiv: 1103.4615 · v1 · pith:MVKHHSEKnew · submitted 2011-03-23 · ⚛️ physics.data-an · stat.ME

Statistical Inference for Valued-Edge Networks: Generalized Exponential Random Graph Models

classification ⚛️ physics.data-an stat.ME
keywords networksanalysisexponentialgraphmodelsrandomstatisticaledges
0
0 comments X
read the original 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, exponential random graph models are a ubiquitous means of analysis. However, they are limited by an inability to model networks with valued edges. We solve this problem by introducing a class of generalized exponential random graph models capable of modeling networks whose edges are valued, thus greatly expanding the scope of networks applied researchers can subject to statistical analysis.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.