Robustness of complex networks: Theory and application

Xiangrong Wang

Research output: ThesisDissertation (TU Delft)

38 Downloads (Pure)

Abstract

Failures of networks, such as power outages in power systems, congestions in
transportation networks, paralyse our daily life and introduce a tremendous cascading effect on our society. Networks should be constructed and operated in a robust way against random failures or deliberate attacks.
We study how to add a single link into an existing network such that the robustness of the network is maximally improved among all the possibilities. A graph metric, the effective graph resistance, is employed to quantify the robustness of the network. Though exhaustive search guarantees the optimal solution, the computational complexity is high and is not scalable with the increase of network size. We propose strategies that take into account the structural and spectral properties of networks and indicate links whose addition result in a high robustness level.
Original languageEnglish
Supervisors/Advisors
  • Van Mieghem, P.F.A., Supervisor
  • Kooij, R.E., Supervisor
Award date21 Dec 2016
Print ISBNs978-94-6186-775-9
DOIs
Publication statusPublished - 2016

Keywords

  • Complex Networks
  • Robustness of Networks
  • Graph Spectra
  • Power Grids
  • Metro Networks
  • Line Graph
  • Eigenvectors/Eigenvalues
  • Interdependent Networks

Fingerprint Dive into the research topics of 'Robustness of complex networks: Theory and application'. Together they form a unique fingerprint.

  • Cite this