विधियों की तुलना करें
चुनी हुई विधियों की आमने-सामने समीक्षा करें; भिन्नता वाली पंक्तियाँ रेखांकित हैं।
| निर्देशित घातीय यादृच्छिक ग्राफ मॉडल× | स्टोकेस्टिक ब्लॉक मॉडल× | |
|---|---|---|
| क्षेत्र | नेटवर्क विश्लेषण | नेटवर्क विश्लेषण |
| परिवार≠ | Machine learning | Process / pipeline |
| उद्भव वर्ष≠ | 1986 (foundations); 2007 (modern directed ERGM formulation) | 1983 |
| प्रवर्तक≠ | Frank, O. & Strauss, D.; extended by Robins, Pattison, Kalish & Lusher | — |
| प्रकार≠ | Statistical generative model for directed networks | Probabilistic 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 model | SBM, degree-corrected SBM, DCSBM, Stokastik Blok Modeli (SBM) |
| संबंधित≠ | 4 | 7 |
| सारांश≠ | 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डेटासेट ↗ |
|
|