Machine learningNetwork science

Weighted Exponential Random Graph Model

The Weighted Exponential Random Graph Model (W-ERGM) extends the classic binary ERGM framework to networks whose edges carry quantitative values — such as frequency of contact, trade volume, or collaboration intensity. It models the entire valued-edge network as a probability distribution defined over all possible weighted graphs, enabling researchers to test whether structural patterns such as reciprocity, transitivity, or degree distribution arise beyond what chance alone would produce.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Krivitsky, P. N. (2012). Exponential-family random graph models for valued networks. Electronic Journal of Statistics, 6, 1100–1128. DOI: 10.1214/12-EJS696
  2. Robins, G., Pattison, P., Kalish, Y., & Lusher, D. (2007). An introduction to exponential random graph (p*) models for social networks. Social Networks, 29(2), 173–191. DOI: 10.1016/j.socnet.2006.08.002

Related methods

Referenced by

ScholarGateWeighted Exponential Random Graph Model (Weighted Exponential Random Graph Model (Valued-Edge ERGM)). Retrieved 2026-06-04 from https://scholargate.app/en/network-analysis/weighted-exponential-random-graph-model