Sumários
Laboratory 07
30 outubro 2015, 15:30 • Alexandre Francisco
Exercises on community finding, CNM algorithm and betweenness based methods. Modularity maximization.
Partitioning graphs and spectral clustering
30 outubro 2015, 14:00 • Alexandre Francisco
Revisiting resolution limit of modularity. Prioritizers in modularity greedy optimization. Graph partitioning vs community finding. Graphs bisection. Kernighan-Lin algorithm revisited. Spectral graph clustering. Sweeping and normalized cuts. Spectral based approach for modularity optimization.
Community finding
26 outubro 2015, 14:00 • Alexandre Francisco
Direct discovery of communities. Finding cliques. Finding communities through betweenness. Modularity. Graph partitioning and modularity optimization. Kernighan-Lin algorithm. Greedy optimization. CNM and Louvain algorithms. Hierarchical clustering. Multi-level methods. Resolution limit.
First project laboratory
23 outubro 2015, 15:30 • Alexandre Francisco
Laboratory dedicated to the first project.
Lesson 13 - robustness of networks
23 outubro 2015, 14:00 • Francisco Correia dos Santos
Network robustness. Percolation theory. Molloy-Reed criterion. Analytic results vs simulations. Finite-size effects. Robustness against targeted attacks vs Robustness against random attacks. Alternative strategies. k-cores. Cascading events.