Sumários
Robustness of networks and cascading events
30 outubro 2017, 14:00 • Francisco Correia dos Santos
PART I: The origins of robustness, complex networks under random failures, robustness toolkit: percolation theory, robustness as an inverse percolation problem, the molloy-reed criterion, robustness of scale-free networks, robustness of finite networks (ex: the Internet), the Achilles’ heel of scale-free networks, robustness against targeted attacks, attack tolerance and strategies, robustness beyond degree dists (clustering, assortativity, etc). k-cores. Optimization and robustness. Other measures of robustness.
PART II: Cascading events and avalanches (power stations, blackouts, airport congestion, internet congestion and protocols, information cascades in Twitter, Earthquakes magnitudes). Three models of cascading models: Kong-Yeh model, Motter-Lai model, and the initial load model.
degree-degree correlations
27 outubro 2017, 14:00 • Francisco Correia dos Santos
Models with death and birth of nodes and links. Measuring degree-degree correlations. Pearson coeff. Correlation matrices. Degree correlation functions. Structural cutoffs and (dis)assortativity. Tunning degree-degree correlations. Impact of assortativity on the APL, network diameter and critical phenomena.
Lab 05
23 outubro 2017, 15:30 • Alexandre Francisco
Large scale data and network analysis: how to deal with large data sets. Project support: part 1.