Local-global interaction and the emergence of scale-free networks with community structures

Modeling pluralism and self-regulation explains the emergence of cooperation in networked societies

Understanding the dynamics of cooperative behavior of individuals in complex societies represents a fundamental research question which puzzles scientists working in heterogeneous fields. Many studies have been developed using the unitary agent assumption, which embeds the idea that when making decisions, individuals share the same socio-cultural parameters. In this paper, we propose the ECHO-EGN model, based on Evolutionary Game Theory, which relaxes this strong assumption by considering the heterogeneity of three fundamental socio-cultural aspects ruling the behavior of groups of people: the propensity to be more cooperative with members of the same group (Endogamic cooperation), the propensity to cooperate with the public domain (Civicness) and the propensity to prefer connections with members of the same group (Homophily). The ECHO-EGN model is shown to have high performance in describing real world behavior of interacting individuals living in complex environments. Extensive numerical experiments allowing the comparison of real data and model simulations confirmed that the introduction of the above mechanisms enhances the realism in the modelling of cooperation dynamics. Additionally, theoretical findings allow us to conclude that endogamic cooperation may limit significantly the emergence of cooperation.

A multiobjective evolutionary algorithm based on similarity for community detection from signed social networks

Various types of social relationships, such as friends and foes, can be represented as signed social networks (SNs) that contain both positive and negative links. Although many community detection (CD) algorithms have been proposed, most of them were designed primarily for networks containing only positive links. Thus, it is important to design CD algorithms which can handle large-scale SNs. To this purpose, we first extend the original similarity to the signed similarity based on the social balance theory. Then, based on the signed similarity and the natural contradiction between positive and negative links, two objective functions are designed to model the problem of detecting communities in SNs as a multiobjective problem. Afterward, we propose a multiobjective evolutionary algorithm, called MEAs-SN. In MEAs-SN, to overcome the defects of direct and indirect representations for communities, a direct and indirect combined representation is designed. Attributing to this representation, MEAs-SN can switch between different representations during the evolutionary process. As a result, MEAs-SN can benefit from both representations. Moreover, owing to this representation, MEAs-SN can also detect overlapping communities directly. In the experiments, both benchmark problems and large-scale synthetic networks generated by various parameter settings are used to validate the performance of MEAs-SN. The experimental results show the effectiveness and efficacy of MEAs-SN on networks with 1000, 5000, and 10,000 nodes and also in various noisy situations. A thorough comparison is also made between MEAs-SN and three existing algorithms, and the results show that MEAs-SN outperforms other algorithms.