Σύγκριση μεθόδων

	Ανάλυση Ανθεκτικότητας και Ευπάθειας Δικτύων	Ανάλυση Κεντρικότητας	Γραφικά Νευρωνικά Δίκτυα
Πεδίο	Ανάλυση Δικτύων	Ανάλυση Δικτύων	Ανάλυση Δικτύων
Οικογένεια	Process / pipeline	Process / pipeline	Process / pipeline
Έτος προέλευσης	2000	1979	2017–2018 (major variants)
Δημιουργός	Albert, Jeong & Barabási	Linton C. Freeman	—
Τύπος	Network robustness / vulnerability framework	Descriptive / exploratory network measure family	Deep learning on graph-structured data
Θεμελιώδης πηγή	Albert, R., Jeong, H. & Barabási, A.L. (2000). Error and attack tolerance of complex networks. Nature, 406, 378–382.	Freeman, L.C. (1979). Centrality in Social Networks: Conceptual Clarification. Social Networks, 1(3), 215-239.	Kipf, T.N. & Welling, M. (2017). Semi-Supervised Classification with Graph Convolutional Networks. International Conference on Learning Representations (ICLR).
Εναλλακτικές ονομασίες	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	GNN, GCN, GAT, GraphSAGE
Συναφείς	5	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.	A Graph Neural Network (GNN) is a deep learning architecture that operates directly on graph-structured data by combining node features with structural information through iterative neighborhood message passing. The three canonical variants — the Graph Convolutional Network (GCN) introduced by Kipf and Welling in 2017, the Graph Attention Network (GAT) introduced by Veličković et al. in 2018, and GraphSAGE — differ in how they aggregate neighbor information: GCN applies a spectral convolution over the full adjacency, GAT weights neighbors by learned attention scores, and GraphSAGE samples and aggregates local neighborhoods inductively, enabling generalization to unseen nodes.