Methoden vergleichen
Prüfen Sie die ausgewählten Methoden nebeneinander; abweichende Zeilen sind hervorgehoben.
| Netzwerkresilienz und Schwachstellenanalyse× | Community Detection× | Multilayer-Netzwerkanalyse× | |
|---|---|---|---|
| Fachgebiet | Netzwerkanalyse | Netzwerkanalyse | Netzwerkanalyse |
| Familie | Process / pipeline | Process / pipeline | Process / pipeline |
| Entstehungsjahr≠ | 2000 | 2002–2019 (algorithm family) | 2013–2014 (formal mathematical framework) |
| Urheber≠ | Albert, Jeong & Barabási | Louvain: Blondel et al. (2008); Leiden: Traag et al. (2019); Girvan-Newman: Girvan & Newman (2002); Infomap: Rosvall & Bergstrom (2008) | Kivelä et al. (2014); De Domenico et al. (2013) |
| Typ≠ | Network robustness / vulnerability framework | Graph-partitioning / clustering algorithm family | Graph-theoretic network model |
| Wegweisende Quelle≠ | Albert, R., Jeong, H. & Barabási, A.L. (2000). Error and attack tolerance of complex networks. Nature, 406, 378–382. DOI ↗ | Blondel, V.D., Guillaume, J.-L., Lambiotte, R. & Lefebvre, E. (2008). Fast Unfolding of Communities in Large Networks. Journal of Statistical Mechanics, 2008(10), P10008. DOI ↗ | Kivelä, M. et al. (2014). Multilayer Networks. Journal of Complex Networks, 2(3), 203–271. DOI ↗ |
| Aliasnamen | network vulnerability analysis, attack tolerance analysis, Ağ Dayanıklılığı ve Güvenlik Açığı Analizi | graph clustering, network partitioning, Topluluk Tespiti (Louvain, Girvan-Newman, Leiden) | multiplex network analysis, multiplex networks, Çok Katmanlı Ağ Analizi (Multiplex Networks) |
| Verwandt≠ | 5 | 5 | 6 |
| Zusammenfassung≠ | 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. | Community detection is a family of graph-partitioning algorithms that discover densely connected sub-groups — communities — within a network. First formalised through the modularity measure by Girvan and Newman (2002), the field advanced rapidly with the Louvain method (Blondel et al., 2008), the Leiden refinement (Traag et al., 2019), and the information-theoretic Infomap approach. All variants answer the same question: which nodes cluster together more tightly among themselves than with the rest of the network? | Multilayer network analysis is a graph-theoretic framework, formalised by Kivelä et al. (2014) and De Domenico et al. (2013), that represents the same set of nodes simultaneously across multiple relationship layers. Where a single-layer network collapses all relationships into one graph, the multilayer model preserves the distinct relational context of each layer — social platform, biological interaction type, or infrastructure tier — while also modelling how layers couple with each other through interlayer edges. |
| ScholarGateDatensatz ↗ |
|
|
|