Joint NeST Center and Computer Science Deparment Colloquium on Community Structure in Complex Networks by Professor Santo Fortunato​ of Indiana University on August 31, 2017.

Professor Santo Fortunato​, Director of the Center for Complex Networks and Systems Research at Indiana University will present a joint colloquium of the NeST Center and Computer Science Department on Community Structure in Complex Networks at 4pm on August 31, 2017.


Abstract: Complex systems typically display a modular structure, as modules are easier to assemble than the individual units of the system, and more resilient to failures. In the network representation of complex systems, modules, or communities, appear as subgraphs whose nodes have an appreciably larger probability to get connected to each other than to other nodes of the network. In this talk I will address three fundamental questions: How is community structure generated? How to detect it? How to test the performance of community detection algorithms? I will show that communities emerge naturally in growing network models favoring triadic closure, a mechanism necessary to implement for the generation of large classes of systems, like e.g. social networks. The presenter will discuss the limits of the most popular class of clustering algorithms, those based on the optimization of a global quality function, like modularity maximization. Testing algorithms is probably the single most important issue of network community detection, as it implicitly involves the concept of community, which is still controversial. The presenter will also discuss the importance of using realistic benchmark graphs with built-in community structure, as well as the role of metadata.


Host: Prof. Boleslaw Szymanski, NeST Center.