Process / pipeline

Exponential Random Graph Model (ERGM / p*)

The Exponential Random Graph Model (ERGM), also known as the p* model, is a statistical framework for network analysis that models the probability of an observed network as a function of its local structural features — such as reciprocity, triangles, and degree distribution. Developed from the foundational work of Frank and Strauss (1986) and extended into the modern framework by Wasserman and Pattison (1996) and Robins et al. (2007), ERGM is the inferential standard for social network analysis, capable of testing whether observed network structures arise by chance or reflect genuine social processes.

Open in MethodMindSoonVideoSoon

Read the full method

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. 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
  2. Lusher, D., Koskinen, J., & Robins, G. (Eds.) (2012). Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications. Cambridge University Press. ISBN: 9780521193566

Related methods

Referenced by

ScholarGateExponential Random Graph Model (Exponential Random Graph Model (ERGM / p*)). Retrieved 2026-06-04 from https://scholargate.app/en/network-analysis/exponential-random-graph