השוואת שיטות

	מודל גרף אקראי מעריכי משוקלל	מודל הבלוקים הסטוכסטי המשוקלל
תחום	ניתוח רשתות	ניתוח רשתות
משפחה	Machine learning	Machine learning
שנת המקור	2012	2014
הוגה השיטה	Krivitsky, P. N.	Aicher, C.; Jacobs, A. Z.; Clauset, A.
סוג	Statistical network model	Generative probabilistic model
מקור מכונן	Krivitsky, P. N. (2012). Exponential-family random graph models for valued networks. Electronic Journal of Statistics, 6, 1100–1128.	Aicher, C., Jacobs, A. Z., & Clauset, A. (2014). Learning latent block structure in weighted networks. Journal of Complex Networks, 3(2), 221–248.
כינויים	W-ERGM, valued ERGM, weighted p-star model, valued exponential random graph model	W-SBM, weighted SBM, weighted block model, weighted community detection via SBM
קשורות	4	6
תקציר	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.	The Weighted Stochastic Block Model (W-SBM) extends the classical stochastic block model to networks whose edges carry numerical weights. By positing that edge weights between node pairs arise from distributions that depend on the block memberships of those nodes, it simultaneously infers a partition of nodes into communities and a set of block-to-block weight parameters — recovering structure invisible to unweighted methods.