Exponential Random Graph Model
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.
Källpost
Citat kopierade ordagrant från metodens källpost. Ingen verifiering på källnivå härleds från dem.
- 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
- Lusher, D., Koskinen, J., & Robins, G. (Eds.) (2012). Exponential Random Graph Models for Social Networks: Theory, Methods, and Applications. Cambridge University Press. · ISBN 9780521193566
Kuraterade påståenden
Påståenden lagrade i bevisloggen, var och en med sin egen bedömning.
Denna vy hittar inte på en påståendebedömning när loggen saknar en.
Relaterade metoder
Genererade från metodgrafen och visade som maskinföreslagna relationer – inga bevispåståenden härleds.