方法证据记录
Centrality Analysis
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.
源记录
引文逐字复制自方法源记录。这些引文不代表任何层级的验证。
Network Centrality Analysis (Degree, Betweenness, Eigenvector)
分类方法记录 · process-pipeline / network-analysis
- Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. · DOI 10.1016/0378-8733(78)90021-7
- Borgatti, S.P. (2005). Centrality and Network Flow. Social Networks, 27(1), 55-71. · DOI 10.1016/j.socnet.2004.11.008
精选声明
声明已持久化到证据分类账中，每个声明都有自己的评估。
尚无精选声明
当分类账中没有声明时，此视图不会自行创建声明评估。
相关方法
从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。