ScholarGate
Asistents

Salīdzināt metodes

Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.

Centrāles analīze×Eksponenciālo tīklu modeļa (ERGM / p*)×
NozareTīklu analīzeTīklu analīze
SaimeProcess / pipelineProcess / pipeline
Izcelsmes gads19791986 (foundational); modern ERGM framework 1996–2007
AutorsLinton C. FreemanFrank & Strauss (1986); extended by Wasserman & Pattison (1996) and Robins et al. (2007)
TipsDescriptive / exploratory network measure familyProbabilistic generative network model
PirmavotsFreeman, 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 ↗
Citi nosaukumiMerkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centralityERGM, p-star model, p* model, Üstel Rastgele Graf Modeli (ERGM / p*)
Saistītās56
KopsavilkumsCentrality 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.
ScholarGateDatu kopa
  1. v1
  2. 2 Avoti
  3. PUBLISHED
  1. v1
  2. 2 Avoti
  3. PUBLISHED

Doties uz meklēšanu Lejupielādēt slaidus

ScholarGateSalīdzināt metodes: Centrality Analysis · Exponential Random Graph Model. Izgūts 2026-06-15 no https://scholargate.app/lv/compare