ScholarGate
어시스턴트

방법 비교

선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.

방향성 무작위 그래프 모델×확률적 블록 모형 (Stochastic Block Model, SBM)×
분야네트워크 분석네트워크 분석
계열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/ko/compare