Measuring Robustness of Complex Networks

Summary

This thesis aims to improve the understanding of complex networks and their robustness and is based on graph theory, of which this thesis is part of.

Keywords

Robustness (evolution), Complex network, Computer science, Complex system, Graph theory

References

Inet-3.0: Internet Topology GeneratorJared Winick, Sugih Jamin — 2002
Influence of degree correlations on network structure and stability in protein-protein interaction networksRaquel Cantos, Pedro Flores, Joaquín Rueda Puente — 2007
Internet topology at the router and autonomous system levelAlexei Vázquez, Romualdo Pastor‐Satorras, Alessandro Vespignani — 2002
A Straight LinePerry A. Zirkel — 1993
Synchronization in complex networksÀlex Arenas, Albert Dı́az-Guilera, Jürgen Kurths — 2008
Complex Networks: Structure and DynamicsShilpa Chakravartula — 2014
Network Reliability and Algebraic StructuresDouglas R. Shier — 1991
Network Resilience: Exploring Cascading Failures within BGP∗E. G. Coffman, Zihui Ge, Vishal Misra — 2006
Epidemic spreading in real networks: an eigenvalue viewpointYang Wang, Deepayan Chakrabarti, Chenxi Wang — 2003
Split multipath routing with maximally disjoint paths in ad hoc networksS.-J. Lee, Mário Gerla — 2001
Assessing risk for network resilienceMarcus Schöller, Paul J. Smith, David Hutchison — 2011
Implementing discrete mathematics - combinatorics and graph theory with MathematicaSteven Skiena — 1990
The Small World ProblemStanley Milgram — 1967
From Epidemics to Distributed ComputingPatrick Eugster, Rachid Guerraoui, Anne-Marie Kermarrec — 2004
Algebraic connectivity of graphsMiroslav Fiedler — 1973
Graph Spectra for Complex NetworksPiet Van Mieghem — 2010
Auto-discovery of shared risk link groupsP. Sebos, Jennifer Yates, Gísli Hjálmtýsson — 2001
Robustness of interdependent networks under targeted attackXuqing Huang, Jianxi Gao, Sergey V. Buldyrev — 2010
Localization on low-order eigenvectors of data matricesMihai Cucuringu, Michael W. Mahoney — 2011
PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPHPiet Van Mieghem — 2001

Cited by

Spectral approaches for identifying kinetic features in molecular dynamics simulations of globular proteinsAndrej J. Savol — 2015
Graph eigenvectors, fundamental weights and centrality metrics for nodes in networksPiet Van Mieghem — 2014
Orthogonal Eigenvector Matrix of the LaplacianXiangrong Wang, Piet Van Mieghem — 2015
The double-edged sword: Revealing the critical role of structural hole in forming trust for securing Wireless sensor networksMing Xiang, William Liu, Quan Bai — 2015
Robustness of complex networks: Theory and applicationX. Wang — 2016
Understanding the Impact of Large-Scale Power Grid Architectures on PerformanceA. Toba — 2018
Assessment of gender divide in scientific communitiesAntonio De Nicola, Gregorio D’Agostino — 2021
Simmelian Ties and Structural Holes: Exploring Their Topological Roles in Forming Trust for Securing Wireless Sensor NetworksXiang, M (15715790), Liu, W (15565472), Quan Bai (14730859) — 2015

Related papers

Graph measures and network robustnessWendy Ellens, Robert E. Kooij — 2013
Comparison of Centralized Methods for Networked Information System Based on Complexity TheoryJin-shi Xiong, Jianhua Li, Qinhua Ren — 2012
Computer network optimizationHadi Rezazad — 2011
Modelling interdependencies over incomplete join structures of power law networksGoitom Kahsay Weldehawaryat, Stephen D. Wolthusen — 2015
Collaboration graph as a new graph definition approachKenan İNCE, Ali Karcı — 2017
Efficient community detection using power graph analysisGeorge Tsatsaronis, Matthias Reimann, Iraklis Varlamis — 2011
Robustness study in closed social networks using spanning tree approachHajar Sahbani, Mohamed El Marraki — 2016
A Distributed Framework for Large-Scale Time-Dependent Graph AnalysisWissem Inoubli, Lívia Almada, Ticiana L. Coelho da Silva — 2017
Symmetry in Complex NetworksÁngel Garrido — 2011