方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 网络韧性与脆弱性分析× | 中心性分析× | |
|---|---|---|
| 领域 | 网络分析 | 网络分析 |
| 方法族 | Process / pipeline | Process / pipeline |
| 起源年份≠ | 2000 | 1979 |
| 提出者≠ | Albert, Jeong & Barabási | Linton C. Freeman |
| 类型≠ | Network robustness / vulnerability framework | Descriptive / exploratory network measure family |
| 开创性文献≠ | Albert, R., Jeong, H. & Barabási, A.L. (2000). Error and attack tolerance of complex networks. Nature, 406, 378–382. DOI ↗ | Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗ |
| 别名≠ | network vulnerability analysis, attack tolerance analysis, Ağ Dayanıklılığı ve Güvenlik Açığı Analizi | Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality |
| 相关 | 5 | 5 |
| 摘要≠ | Network resilience and vulnerability analysis is an analytical framework, formalised by Albert, Jeong, and Barabási (2000), that measures how a network degrades functionally as nodes or edges are progressively removed. By running targeted-attack simulations — removing the highest-centrality nodes first — and random-failure simulations — removing nodes at uniform probability — the framework identifies which structural elements are critical to network integrity and where infrastructure is most exposed. | 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. |
| ScholarGate数据集 ↗ |
|
|