השוואת שיטות

	ניתוח מרכזיות	מודל גרף אקראי מעריכי (ERGM / p*)
תחום	ניתוח רשתות	ניתוח רשתות
משפחה	Process / pipeline	Process / pipeline
שנת המקור	1979	1986 (foundational); modern ERGM framework 1996–2007
הוגה השיטה	Linton C. Freeman	Frank & Strauss (1986); extended by Wasserman & Pattison (1996) and Robins et al. (2007)
סוג	Descriptive / exploratory network measure family	Probabilistic generative network model
מקור מכונן	Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239.	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.
כינויים	Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality	ERGM, p-star model, p* model, Üstel Rastgele Graf Modeli (ERGM / p*)
קשורות	5	6
תקציר	Centrality analysis is a family of network-analytic measures, formalized by Freeman (1979), that quantifies the structural importance of individual nodes within a graph. Each centrality index captures a distinct mechanism of influence: degree centrality reflects direct connectivity, betweenness centrality identifies nodes that broker information flow, closeness centrality captures proximity to all others, and eigenvector centrality (along with PageRank) rewards connection to highly connected neighbors.	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.