- Vincent Traag from the Centre for Science and Technology Studies will give an LCN2 seminar on April 29th at 16:00 in room HL214, titled 'Methods & algorithms for detecting communities in large networks'.
Many complex networks have a modular structure: groups of densely connected nodes with few connections between the groups. Nodes in such groups often have something in common, and enrich our understanding of complex networks. Finding such so-called communities in large networks is far from trivial. One of the best-known methods for community detection is modularity, which specifies a quality function of a partition. However, modularity suffers from a well-known flaw, known as the resolution limit: it tends to oversimplify, and lump together several (sub)communities in one large community. We here show that only few quality functions can address this issue. One of the best algorithms for optimising modularity is the Louvain algorithm. We here show that it can lead to arbitrarily badly connected communities---in addition to the resolution limit of modularity. In particular, it can lead to disconnected communities. We here introduce a new algorithm, and show it not only addresses this caveat, but also that it asymptotically ensures that no subset of any community can be moved to another community. Finally, we introduce a fast local move subroutine, speeding up the algorithm 5-10 times.
Preliminary LCN2 Seminar Schedule - 2016
January 29, 16:00-17:00, HL214
February 27, 16:00-17:00, HL106
April 29, 16:00-17:00, HL214
May 27, 16:00-17:00, HL214
Publ. 26-04-2016 12:38