Networks, Communities, and the Science of Sciences

From Santa Fe Institute

Santo Fortunato, Indiana University Bloomington Detecting network communities, i.e. subgraphs whose nodes have an appreciably larger probability to get connected to each other than to other nodes of the network, is a fundamental problem in network science. Here I will discuss three major issues. First, I will address the limits of the most popular class of clustering algorithms, those based on the optimization of a global quality function, like modularity maximization. Second, I will critical...