ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

مدل گراف تصادفی نمایی جهت‌دار×مدل بلوک تصادفی×
حوزهتحلیل شبکهتحلیل شبکه
خانوادهMachine learningProcess / pipeline
سال پیدایش1986 (foundations); 2007 (modern directed ERGM formulation)1983
پدیدآورFrank, O. & Strauss, D.; extended by Robins, Pattison, Kalish & Lusher
نوعStatistical generative model for directed networksProbabilistic generative graph model
منبع بنیادین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 ↗Holland, P.W., Laskey, K.B. & Leinhardt, S. (1983). Stochastic Blockmodels: First Steps. Social Networks, 5(2), 109-137. DOI ↗
نام‌های دیگرDirected ERGM, p-star model (directed), directed p* model, directed Markov graph modelSBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM)
مرتبط47
خلاصهThe Directed Exponential Random Graph Model (Directed ERGM) is a family of statistical models for directed networks that estimates the probability of observing a given directed graph as a function of structural configurations — such as reciprocity, transitive triads, and in-degree centralization — and node or dyad covariates, enabling principled inference about the social processes that generate directed ties.The Stochastic Block Model (SBM), introduced by Holland, Laskey and Leinhardt (1983), is a probabilistic generative model for graphs that assigns nodes to latent blocks and parametrically estimates the connection probabilities between blocks. It is the foundational approach for community detection, core-periphery identification, and hierarchical structure discovery in network analysis.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Directed Exponential Random Graph Model · Stochastic Block Model. بازیابی‌شده در 2026-06-15 از https://scholargate.app/fa/compare