방법 비교
선택한 방법을 나란히 검토하세요. 서로 다른 행은 강조 표시됩니다.
| 중심성 분석× | 네트워크 복원력 및 취약성 분석× | |
|---|---|---|
| 분야 | 네트워크 분석 | 네트워크 분석 |
| 계열 | Process / pipeline | Process / pipeline |
| 기원 연도≠ | 1979 | 2000 |
| 창시자≠ | Linton C. Freeman | Albert, Jeong & Barabási |
| 유형≠ | Descriptive / exploratory network measure family | Network robustness / vulnerability framework |
| 원전≠ | Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239. DOI ↗ | Albert, R., Jeong, H. & Barabási, A.L. (2000). Error and attack tolerance of complex networks. Nature, 406, 378–382. DOI ↗ |
| 별칭≠ | Merkeziyet Analizi (Degree, Betweenness, Eigenvector), node centrality, centrality measures, graph centrality | network vulnerability analysis, attack tolerance analysis, Ağ Dayanıklılığı ve Güvenlik Açığı Analizi |
| 관련 | 5 | 5 |
| 요약≠ | 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 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. |
| ScholarGate데이터셋 ↗ |
|
|