পদ্ধতির তুলনা করুন
নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।
| কেন্দ্রিকতা বিশ্লেষণ× | Exponential Random Graph Model (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. DOI ↗ | 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 ↗ |
| অপর নাম | 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. |
| ScholarGateডেটাসেট ↗ |
|
|