If players are sparse social dilemmas are too: Importance of percolation for evolution of cooperation

Spatial reciprocity is a well known tour de force of cooperation promotion. A thorough understanding of the effects of different population densities is therefore crucial. Here we study the evolution of cooperation in social dilemmas on different interaction graphs with a certain fraction of vacant nodes. We find that sparsity may favor the resolution of social dilemmas, especially if the population density is close to the percolation threshold of the underlying graph. Regardless of the type of the governing social dilemma as well as particularities of the interaction graph, we show that under pairwise imitation the percolation threshold is a universal indicator of how dense the occupancy ought to be for cooperation to be optimally promoted. We also demonstrate that myopic updating, due to the lack of efficient spread of information via imitation, renders the reported mechanism dysfunctional, which in turn further strengthens its foundations.Comment: 6 two-column pages, 5 figures; accepted for publication in Scientific Reports [related work available at http://arxiv.org/abs/1205.0541

The Clinical Utility of SUDOSCAN in Chronic Kidney Disease in Chinese Patients with Type 2 Diabetes

published_or_final_versio

Interdependent network reciprocity in evolutionary games

Besides the structure of interactions within networks, also the interactions between networks are of the outmost importance. We therefore study the outcome of the public goods game on two interdependent networks that are connected by means of a utility function, which determines how payoffs on both networks jointly influence the success of players in each individual network. We show that an unbiased coupling allows the spontaneous emergence of interdependent network reciprocity, which is capable to maintain healthy levels of public cooperation even in extremely adverse conditions. The mechanism, however, requires simultaneous formation of correlated cooperator clusters on both networks. If this does not emerge or if the coordination process is disturbed, network reciprocity fails, resulting in the total collapse of cooperation. Network interdependence can thus be exploited effectively to promote cooperation past the limits imposed by isolated networks, but only if the coordination between the interdependent networks is not disturbe

Modeling Evolutionary Dynamics of Lurking in Social Networks

Lurking is a complex user-behavioral phenomenon that occurs in all large-scale online communities and social networks. It generally refers to the behavior characterizing users that benefit from the information produced by others in the community without actively contributing back to the production of social content. The amount and evolution of lurkers may strongly affect an online social environment, therefore understanding the lurking dynamics and identifying strategies to curb this trend are relevant problems. In this regard, we introduce the Lurker Game, i.e., a model for analyzing the transitions from a lurking to a non-lurking (i.e., active) user role, and vice versa, in terms of evolutionary game theory. We evaluate the proposed Lurker Game by arranging agents on complex networks and analyzing the system evolution, seeking relations between the network topology and the final equilibrium of the game. Results suggest that the Lurker Game is suitable to model the lurking dynamics, showing how the adoption of rewarding mechanisms combined with the modeling of hypothetical heterogeneity of users' interests may lead users in an online community towards a cooperative behavior.Comment: 13 pages, 5 figures. Accepted at CompleNet 201

Optimal interdependence between networks for the evolution of cooperation

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality

Learning and innovative elements of strategy adoption rules expand cooperative network topologies

Cooperation plays a key role in the evolution of complex systems. However, the level of cooperation extensively varies with the topology of agent networks in the widely used models of repeated games. Here we show that cooperation remains rather stable by applying the reinforcement learning strategy adoption rule, Q-learning on a variety of random, regular, small-word, scale-free and modular network models in repeated, multi-agent Prisoners Dilemma and Hawk-Dove games. Furthermore, we found that using the above model systems other long-term learning strategy adoption rules also promote cooperation, while introducing a low level of noise (as a model of innovation) to the strategy adoption rules makes the level of cooperation less dependent on the actual network topology. Our results demonstrate that long-term learning and random elements in the strategy adoption rules, when acting together, extend the range of network topologies enabling the development of cooperation at a wider range of costs and temptations. These results suggest that a balanced duo of learning and innovation may help to preserve cooperation during the re-organization of real-world networks, and may play a prominent role in the evolution of self-organizing, complex systems.Comment: 14 pages, 3 Figures + a Supplementary Material with 25 pages, 3 Tables, 12 Figures and 116 reference

Resolution of the stochastic strategy spatial prisoner's dilemma by means of particle swarm optimization

We study the evolution of cooperation among selfish individuals in the stochastic strategy spatial prisoner's dilemma game. We equip players with the particle swarm optimization technique, and find that it may lead to highly cooperative states even if the temptations to defect are strong. The concept of particle swarm optimization was originally introduced within a simple model of social dynamics that can describe the formation of a swarm, i.e., analogous to a swarm of bees searching for a food source. Essentially, particle swarm optimization foresees changes in the velocity profile of each player, such that the best locations are targeted and eventually occupied. In our case, each player keeps track of the highest payoff attained within a local topological neighborhood and its individual highest payoff. Thus, players make use of their own memory that keeps score of the most profitable strategy in previous actions, as well as use of the knowledge gained by the swarm as a whole, to find the best available strategy for themselves and the society. Following extensive simulations of this setup, we find a significant increase in the level of cooperation for a wide range of parameters, and also a full resolution of the prisoner's dilemma. We also demonstrate extreme efficiency of the optimization algorithm when dealing with environments that strongly favor the proliferation of defection, which in turn suggests that swarming could be an important phenomenon by means of which cooperation can be sustained even under highly unfavorable conditions. We thus present an alternative way of understanding the evolution of cooperative behavior and its ubiquitous presence in nature, and we hope that this study will be inspirational for future efforts aimed in this direction.Comment: 12 pages, 4 figures; accepted for publication in PLoS ON

Fast flowing populations are not well mixed

In evolutionary dynamics, well-mixed populations are almost always associated with all-to-all interactions; mathematical models are based on complete graphs. In most cases, these models do not predict fixation probabilities in groups of individuals mixed by flows. We propose an analytical description in the fast-flow limit. This approach is valid for processes with global and local selection, and accurately predicts the suppression of selection as competition becomes more local. It provides a modelling tool for biological or social systems with individuals in motion.Comment: 19 pages, 8 figure

Large-scale plasma proteomic profiling identifies a high-performance biomarker panel for Alzheimer's disease screening and staging

INTRODUCTION: Blood proteins are emerging as candidate biomarkers for Alzheimer's disease (AD). We systematically profiled the plasma proteome to identify novel AD blood biomarkers and develop a high-performance, blood-based test for AD. METHODS: We quantified 1160 plasma proteins in a Hong Kong Chinese cohort by high-throughput proximity extension assay and validated the results in an independent cohort. In subgroup analyses, plasma biomarkers for amyloid, tau, phosphorylated tau, and neurodegeneration were used as endophenotypes of AD. RESULTS: We identified 429 proteins that were dysregulated in AD plasma. We selected 19 “hub proteins” representative of the AD plasma protein profile, which formed the basis of a scoring system that accurately classified clinical AD (area under the curve = 0.9690–0.9816) and associated endophenotypes. Moreover, specific hub proteins exhibit disease stage-dependent dysregulation, which can delineate AD stages. DISCUSSION: This study comprehensively profiled the AD plasma proteome and serves as a foundation for a high-performance, blood-based test for clinical AD screening and staging