The characterization of network community structure has profound implications in several scientific areas. Therefore, testing the algorithms developed to establish the optimal division of a network into communities is a fundamental problem in the field. We performed here a highly detailed evaluation of community detection algorithms, which has two main novelties: 1) using complex closed benchmarks, which provide precise ways to assess whether the solutions generated by the algorithms are optimal; and, 2) A novel type of analysis, based on hierarchically clustering the solutions suggested by multiple community detection algorithms, which allows to easily visualize how different are those solutions. Surprise, a global parameter that evaluates the quality of a partition, confirms the power of these analyses. We show that none of the community detection algorithms tested provide consistently optimal results in all networks and that Surprise maximization, obtained by combining multiple algorithms, obtains quasi-optimal performances in these difficult benchmarks.
To understand how a complex system is organized and functions, researchers often identify communities in the system's network of interactions. Because it is practically impossible to explore all solutions to guarantee the best one, many community-detection algorithms rely on multiple stochastic searches. But for a given combination of network and stochastic algorithm, how many searches are sufficient to find a solution that is good enough? The standard approach is to pick a reasonably large number of searches and select the network partition with the highest quality or derive a consensus solut…
Understanding the epidemic dynamics, and finding out efficient techniques to control it, is a challenging issue. A lot of research has been done on targeted immunization strategies, exploiting various global network topological properties. However, in practice, information about the global structure of the contact network may not be available. Therefore, immunization strategies that can deal with a limited knowledge of the network structure are required. In this paper, we propose targeted immunization strategies that require information only at the community level. Results of our investigation…
Network dismantling is a relevant research area in network science, gathering attention both from a theoretical and an operational point of view. Here, we propose a general framework for dismantling that prioritizes the removal of nodes that bridge together different network communities. The strategies we detect are not unique, as they depend on the specific realization of the community detection algorithm considered. However, when applying the methodology to some real-world networks we find that the percolation threshold at which dismantling occurs is strongly robust, and it does not depend o…
Community structure is one of the most relevant features encountered in numerous real-world applications of networked systems. Despite the tremendous effort of scientists working on this subject over the past few decades to characterize, model, and analyze communities, more investigations are needed to better understand the impact of community structure and its dynamics on networked systems. Here, we first focus on generative models of communities in complex networks and their role in developing strong foundation for community detection algorithms. We discuss modularity and the use of modulari…
Although community structure is ubiquitous in complex networks, few works exploit this topological property to control epidemics. In this work, devoted to networks with non-overlapping community structure (i.e, a node belongs to a single community), we propose and investigate three deterministic immunization strategies. In order to characterize the influence of a node, various pieces of information are used such as the number of communities that the node can reach in one hop, the nature of the links (intra community links, inter community links), the size of the communities, and the interconne…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics as a discrete time Markovian process with probabilities of transition expressed in terms of a symmetric matrix of weights. In the first part, we describe the matrices of weights that define local random walk strategies like the normal random walk, biased random walks, random walks in the context of digital image processing and maximum entropy random walks. In…
Most researches on adaptive networks mainly concentrate on the properties of steady state, but neglect transient dynamics. In this study, we pay attention to the emergence of community structures in transient process and the effects of community-based control strategies on epidemic spreading. First, by normalizing modularity $Q$, we investigate the evolution of community structures during the transient process, and find that very strong community structures are induced by rewiring mechanism in the early stage of epidemic spreading, which remarkably delays the outbreaks of epidemic. Then we stu…
Many real-world networks known as attributed networks contain two types of information: topology information and node attributes. It is a challenging task on how to use these two types of information to explore structural regularities. In this paper, by characterizing potential relationship between link communities and node attributes, a principled statistical model named PSB_PG that generates link topology and node attributes is proposed. This model for generating links is based on the stochastic blockmodels following a Poisson distribution. Therefore, it is capable of detecting a wide range …
Socialbots are intelligent software controlling all the behavior of fake accounts in an online social network. They use artificial intelligence techniques to pass themselves off as human social media users. Socialbots exploit user trust to achieve their malicious goals, such as astroturfing, performing Sybil attacks, spamming, and harvesting private data. The first phase to countermeasure the malicious activities of the socialbots is studying their characteristics and revealing strategies they can employ to successfully infiltrate stealthily into target online social network. In this paper,we …
Community detection is an important task in network analysis. A community (also referred to as a cluster) is a set of cohesive vertices that have more connections inside the set than outside. In many social and information networks, these communities naturally overlap. For instance, in a social network, each vertex in a graph corresponds to an individual who usually participates in multiple communities. In this paper, we propose an efficient overlapping community detection algorithm using a seed expansion approach. The key idea of our algorithm is to find good seeds, and then greedily expand t…
Although the inference of global community structure in networks has recently become a topic of great interest in the physics community, all such algorithms require that the graph be completely known. Here, we define both a measure of local community structure and an algorithm that infers the hierarchy of communities that enclose a given vertex by exploring the graph one vertex at a time. This algorithm runs in time O(d*k^2) for general graphs when $d$ is the mean degree and k is the number of vertices to be explored. For graphs where exploring a new vertex is time-consuming, the running time …
Components of complex systems are often classified according to the way they interact with each other. In graph theory such groups are known as clusters or communities. Many different techniques have been recently proposed to detect them, some of which involve inference methods using either Bayesian or Maximum Likelihood approaches. In this article, we study a statistical model designed for detecting clusters based on connection similarity. The basic assumption of the model is that the graph was generated by a certain grouping of the nodes and an Expectation Maximization algorithm is employed …
Understanding the network structure, and finding out the influential nodes is a challenging issue in the large networks. Identifying the most influential nodes in the network can be useful in many applications like immunization of nodes in case of epidemic spreading, during intentional attacks on complex networks. A lot of research is done to devise centrality measures which could efficiently identify the most influential nodes in the network. There are two major approaches to the problem: On one hand, deterministic strategies that exploit knowledge about the overall network topology in order …
Following the highly restrictive measures adopted by many countries for combating the current pandemic, the number of individuals infected by SARS-CoV-2 and the associated number of deaths is steadily decreasing. This fact, together with the impossibility of maintaining the lockdown indefinitely, raises the crucial question of whether it is possible to design an exit strategy based on quantitative analysis. Guided by rigorous mathematical results, we show that this is indeed possible: we present a robust numerical algorithm which can compute the cumulative number of deaths that will occur as a…
Community analysis is an important way to ascertain whether or not a complex system consists of sub-structures with different properties. In this paper, we give a two level community structure analysis for the SSCI journal system by most similar co-citation pattern. Five different strategies for the selection of most similar node (journal) pairs are introduced. The efficiency is checked by the normalized mutual information technique. Statistical properties and comparisons of the community results show that both of the two level detection could give instructional information for the community s…
Different strategies have been considered to extract information from social media about how similarly people react to the same news or event. In this context, a powerful method is offered by the application of graph techniques to the contents produced by social network users. In particular, large events typically attract enough content traffic along time to enable an analysis that explicitly models a dependence from the time dimension. Here we demonstrate how it is possible to extend the application of community detection strategies in complex networks to the case of time-dependent multilayer…
Community detection is one of the most studied problems on complex networks. Although hundreds of methods have been proposed so far, there is still no universally accepted formal definition of what is a good community. As a consequence, the problem of the evaluation and the comparison of the quality of the solutions produced by these algorithms is still an open question, despite constant progress on the topic. In this article, we investigate how using a multi-criteria evaluation can solve some of the existing problems of community evaluation, in particular the question of multiple equally-rele…
The discovery of community structure in networks is a problem of considerable interest in recent years. In online social networks, often times, users are simultaneously involved in multiple social media sites, some of which share common social relationships. It is of great interest to uncover a shared community structure across these networks. However, in reality, users typically identify themselves with different usernames across social media sites. This creates a great difficulty in detecting the community structure. In this paper, we explore several approaches for community detection across…
The 2019 Novel Corona virus infection (COVID 19) is an ongoing public health emergency of international focus. Significant gaps persist in our knowledge of COVID 19 epidemiology, transmission dynamics, investigation tools and management, despite (or possibly because of) the fact that the outbreak is an unprecedented global threat. On the positive side, enough is currently known about the epidemic process to permit the construction of mathematical predictive models. In our work, we adapt a traditional SEIR epidemic model to the specific dynamic compartments and epidemic parameters of COVID 19, …
We consider the algorithmic problem of selecting a set of target nodes that cause the biggest activation cascade in a network. In case when the activation process obeys the diminishing returns property, a simple hill-climbing selection mechanism has been shown to achieve a provably good performance. Here we study models of influence propagation that exhibit critical behavior, and where the property of diminishing returns does not hold. We demonstrate that in such systems, the structural properties of networks can play a significant role. We focus on networks with two loosely coupled communitie…
Prosocial incentive can promote cooperation, but providing incentive is costly. Institutions in human society may prefer to use an incentive strategy which is able to promote cooperation at a reasonable cost. However, thus far few works have explored the optimal institutional incentives which minimize related cost for the benefit of public cooperation. In this work, in combination with optimal control theory we thus formulate two optimal control problems to explore the optimal incentive strategies for institutional reward and punishment respectively. By using the approach of Hamilton-Jacobi-Be…
