পদ্ধতির তুলনা করুন

	ওয়েটেড এক্সপোনেনশিয়াল র‍্যান্ডম গ্রাফ মডেল	ভারিত সামাজিক নেটওয়ার্ক বিশ্লেষণ
ক্ষেত্র	নেটওয়ার্ক বিশ্লেষণ	নেটওয়ার্ক বিশ্লেষণ
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	2012	2004–2010
প্রবর্তক	Krivitsky, P. N.	Barrat, A.; Opsahl, T. et al.
ধরন	Statistical network model	Network analysis framework
মৌলিক উৎস	Krivitsky, P. N. (2012). Exponential-family random graph models for valued networks. Electronic Journal of Statistics, 6, 1100–1128.	Barrat, A., Barthélemy, M., Pastor-Satorras, R., & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752.
অপর নাম	W-ERGM, valued ERGM, weighted p-star model, valued exponential random graph model	Weighted SNA, valued network analysis, tie-strength network analysis, weighted graph analysis
সম্পর্কিত	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.	Weighted Social Network Analysis extends classical SNA by assigning numeric values — weights — to ties between actors, capturing tie strength, interaction frequency, or resource flow. Rather than treating all connections as equal, it reveals who holds privileged positions by virtue of the intensity, not merely the existence, of their relationships.