Visiting Speaker
Santo Fortunato
Professor of Complex Systems, Indiana University; CNetS Director; IUNI Scientific Director
Community structure in complex networks
Fri
Feb 10, 2017
Download TALK slides
1:00 pm
177 Huntington Ave
11th floor
Pizza & soda will be served in the 10th Floor Kitchen at 12:20 PM.
ADD to calendar

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. I 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. I will discuss the importance of using realistic benchmark graphs with built-in community structure.

about the speaker
Santo Fortunato is the Director of the Center for Complex Networks and Systems Research (CNetS) at Indiana University and a Scientific Director of Indiana University Network Science Institute (IUNI). Previously he was a professor of complex systems at the Department of Computer Science of Aalto University, Finland. Professor Fortunato got his PhD in Theoretical Particle Physics at the University of Bielefeld In Germany. He then moved to the field of complex systems, via a postdoctoral appointment at the School of Informatics and Computing of Indiana University. His current focus areas are network science, especially community detection in graphs, computational social science and science of science. His research has been published in leading journals, including Nature, PNAS, Physical Review Letters, Reviews of Modern Physics, Physics Reports and has collected about 18,000 citations (Google Scholar). His review article Community detection in graphs (Physics Reports 486, 75-174, 2010) is the most cited paper on networks of the last years. He received the Young Scientist Award for Socio- and Econophysics 2011, a prize given by the German Physical Society, for his outstanding contributions to the physics of social systems.

No upcoming events

Thank you! You have been added to our email list.

Oops! Something went wrong while submitting the form