Characterization of complex networks: Application to robustness analysis

This thesis focuses on the topological characterization of complex networks. It specifically focuses on those elementary graph measures that are of interest when quantifying topology-related aspects of the robustness of complex networks. This thesis makes the following contributions to the field of complex networks. Firstly, the thesis analyses...

Random graphs: From static to dynamic

Many empirical studies on real-life networks show that many networks are small worlds, meaning that typical distances in these networks are small, and many of them have power-law degree sequences, meaning that the number of nodes with degree k falls off as kˆ (-τ) for some exponent τ>1. These networks are modeled by means of scale-free random...