Testing macroecological theories in cryptocurrency market: neutral models cannot describe diversity patterns and their variation.

We develop an analysis of the cryptocurrency market borrowing methods and concepts from ecology. This approach makes it possible to identify specific diversity patterns and their variation, in close analogy with ecological systems, and to characterize the cryptocurrency market in an effective way. At the same time, it shows how non-biological systems can have an important role in contrasting different ecological theories and in testing the use of neutral models. The study of the cryptocurrencies abundance distribution and the evolution of the community structure strongly indicates that these statistical patterns are not consistent with neutrality. In particular, the necessity to increase the temporal change in community composition when the number of cryptocurrencies grows, suggests that their interactions are not necessarily weak. The analysis of the intraspecific and interspecific interdependency supports this fact and demonstrates the presence of a market sector influenced by mutualistic relations. These latest findings challenge the hypothesis of weakly interacting symmetric species, the postulate at the heart of neutral models.

Polarization inhibits the phase transition of Axelrod's model.

We study the effect of polarization in Axelrod's model of cultural dissemination. This is done through the introduction of a cultural feature that takes only two values, while the other features can present a larger number of possible traits. Our numerical results and mean-field approximations show that polarization reduces the characteristic phase transition of the original model to a finite-size effect, since at the thermodynamic limit only the ordered phase is present. Furthermore, for finite system sizes, the stationary state depends on the percolation threshold of the network where the model is implemented: a polarized phase is obtained for percolation thresholds below 1/2, and a fragmented multicultural one otherwise.

Analyzing a networked social algorithm for collective selection of representative committees.

A recent work (Hernández, et al., 2018) introduced a networked voting rule supported by a trust-based social network, where indications of possible representatives were based on individuals opinions. Individual contributions went beyond a simple vote-counting and were based on proxy voting. This mechanism selects committees with high levels of representativeness, weakening the possibility of patronage relations. By incorporating the integrity of individuals and its perception, we here address the question of the resulting committee's trustability. Our results show that this voting rule provides sufficiently small committees with high levels of representativeness and integrity. Furthermore, the voting system displays robustness to strategic and untruthful application of the voting algorithm.

A networked voting rule for democratic representation.

We introduce a general framework for exploring the problem of selecting a committee of representatives with the aim of studying a networked voting rule based on a decentralized large-scale platform, which can assure a strong accountability of the elected. The results of our simulations suggest that this algorithm-based approach is able to obtain a high representativeness for relatively small committees, performing even better than a classical voting rule based on a closed list of candidates. We show that a general relation between committee size and representatives exists in the form of an inverse square root law and that the normalized committee size approximately scales with the inverse of the community size, allowing the scalability to very large populations. These findings are not strongly influenced by the different networks used to describe the individuals' interactions, except for the presence of few individuals with very high connectivity which can have a marginal negative effect in the committee selection process.

Cities, from Information to Interaction.

From physics to the social sciences, information is now seen as a fundamental component of reality. However, a form of information seems still underestimated, perhaps precisely because it is so pervasive that we take it for granted: the information encoded in the very environment we live in. We still do not fully understand how information takes the form of cities, and how our minds deal with it in order to learn about the world, make daily decisions, and take part in the complex system of interactions we create as we live together. This paper addresses three related problems that need to be solved if we are to understand the role of environmental information: (1) the physical problem: how can we preserve information in the built environment? (2) The semantic problem: how do we make environmental information meaningful? and (3) the pragmatic problem: how do we use environmental information in our daily lives? Attempting to devise a solution to these problems, we introduce a three-layered model of information in cities, namely environmental information in physical space, environmental information in semantic space, and the information enacted by interacting agents. We propose forms of estimating entropy in these different layers, and apply these measures to emblematic urban cases and simulated scenarios. Our results suggest that ordered spatial structures and diverse land use patterns encode information, and that aspects of physical and semantic information affect coordination in interaction systems.

The role of neighbours selection on cohesion and order of swarms.

We introduce a multi-agent model for exploring how selection of neighbours determines some aspects of order and cohesion in swarms. The model algorithm states that every agents' motion seeks for an optimal distance from the nearest topological neighbour encompassed in a limited attention field. Despite the great simplicity of the implementation, varying the amplitude of the attention landscape, swarms pass from cohesive and regular structures towards fragmented and irregular configurations. Interestingly, this movement rule is an ideal candidate for implementing the selfish herd hypothesis which explains aggregation of alarmed group of social animals.

Viability of an elementary syntactic structure in a population playing naming games.

We explore how the social dynamics of communication and learning can bring about the rise of a syntactic communication in a population of speakers. Our study is developed starting from a version of the Naming Game model in which an elementary syntactic structure is introduced. This analysis shows how the transition from nonsyntactic to syntactic communication is socially favored in communities which need to exchange a large number of concepts.

Consequence of reputation in an open-ended naming game.

We study a modified version of the naming game, a recently introduced model which describes how shared vocabulary can emerge spontaneously in a population without any central control. In particular, we introduce a mechanism that allows a continuous interchange with the external inventory of words. A playing strategy, influenced by the hierarchical structure that individuals' reputation defines in the community, is implemented. We analyze how these features influence the convergence times, the cognitive efforts of the agents, and the scaling behavior in memory and time.