ASU Scholarship Showcase

The evolution of cooperation is a fundamental problem in biology, especially for non-relatives, where indirect fitness benefits cannot counter within-group inequalities. Multilevel selection models show how cooperation can evolve if it generates a group-level advantage, even when cooperators are disadvantaged within their group. This allows the possibility of group selection, but few examples have been described in nature. Here we show that group selection can explain the evolution of cooperative nest founding in the harvester ant Pogonomyrmex californicus. Through most of this species’ range, colonies are founded by single queens, but in some populations nests are instead founded by cooperative groups of unrelated queens. In mixed groups of cooperative and single-founding queens, we found that aggressive individuals had a survival advantage within their nest, but foundress groups with such non-cooperators died out more often than those with only cooperative members. An agent-based model shows that the between-group advantage of the cooperative phenotype drives it to fixation, despite its within-group disadvantage, but only when population density is high enough to make between-group competition intense. Field data show higher nest density in a population where cooperative founding is common, consistent with greater density driving the evolution of cooperative foundation through group selection.

Human societies are unique in the level of cooperation among non-kin. Evolutionary models explaining this behavior typically assume pure strategies of cooperation and defection. Behavioral experiments, however, demonstrate that humans are typically conditional co-operators who have other-regarding preferences. Building on existing models on the evolution of cooperation and costly punishment, we use a utilitarian formulation of agent decision making to explore conditions that support the emergence of cooperative behavior. Our results indicate that cooperation levels are significantly lower for larger groups in contrast to the original pure strategy model. Here, defection behavior not only diminishes the public good, but also affects the expectations of group members leading conditional co-operators to change their strategies. Hence defection has a more damaging effect when decisions are based on expectations and not only pure strategies.

A relatively unexplored issue in cybersecurity science and engineering is whether there exist intrinsic patterns of cyberattacks. Conventional wisdom favors absence of such patterns due to the overwhelming complexity of the modern cyberspace. Surprisingly, through a detailed analysis of an extensive data set that records the time-dependent frequencies of attacks over a relatively wide range of consecutive IP addresses, we successfully uncover intrinsic spatiotemporal patterns underlying cyberattacks, where the term “spatio” refers to the IP address space. In particular, we focus on analyzing macroscopic properties of the attack traffic flows and identify two main patterns with distinct spatiotemporal characteristics: deterministic and stochastic. Strikingly, there are very few sets of major attackers committing almost all the attacks, since their attack “fingerprints” and target selection scheme can be unequivocally identified according to the very limited number of unique spatiotemporal characteristics, each of which only exists on a consecutive IP region and differs significantly from the others. We utilize a number of quantitative measures, including the flux-fluctuation law, the Markov state transition probability matrix, and predictability measures, to characterize the attack patterns in a comprehensive manner. A general finding is that the attack patterns possess high degrees of predictability, potentially paving the way to anticipating and, consequently, mitigating or even preventing large-scale cyberattacks using macroscopic approaches.

Supply-demand processes take place on a large variety of real-world networked systems ranging from power grids and the internet to social networking and urban systems. In a modern infrastructure, supply-demand systems are constantly expanding, leading to constant increase in load requirement for resources and consequently, to problems such as low efficiency, resource scarcity, and partial system failures. Under certain conditions global catastrophe on the scale of the whole system can occur through the dynamical process of cascading failures. We investigate optimization and resilience of time-varying supply-demand systems by constructing network models of such systems, where resources are transported from the supplier sites to users through various links. Here by optimization we mean minimization of the maximum load on links, and system resilience can be characterized using the cascading failure size of users who fail to connect with suppliers.

We consider two representative classes of supply schemes: load driven supply and fix fraction supply. Our findings are: (1) optimized systems are more robust since relatively smaller cascading failures occur when triggered by external perturbation to the links; (2) a large fraction of links can be free of load if resources are directed to transport through the shortest paths; (3) redundant links in the performance of the system can help to reroute the traffic but may undesirably transmit and enlarge the failure size of the system; (4) the patterns of cascading failures depend strongly upon the capacity of links; (5) the specific location of the trigger determines the specific route of cascading failure, but has little effect on the final cascading size; (6) system expansion typically reduces the efficiency; and (7) when the locations of the suppliers are optimized over a long expanding period, fewer suppliers are required. These results hold for heterogeneous networks in general, providing insights into designing optimal and resilient complex supply-demand systems that expand constantly in time.

Online communities are becoming increasingly important as platforms for large-scale human cooperation. These communities allow users seeking and sharing professional skills to solve problems collaboratively. To investigate how users cooperate to complete a large number of knowledge-producing tasks, we analyze Stack Exchange, one of the largest question and answer systems in the world. We construct attention networks to model the growth of 110 communities in the Stack Exchange system and quantify individual answering strategies using the linking dynamics on attention networks. We identify two answering strategies. Strategy A aims at performing maintenance by doing simple tasks, whereas strategy B aims at investing time in doing challenging tasks. Both strategies are important: empirical evidence shows that strategy A decreases the median waiting time for answers and strategy B increases the acceptance rate of answers. In investigating the strategic persistence of users, we find that users tends to stick on the same strategy over time in a community, but switch from one strategy to the other across communities. This finding reveals the different sets of knowledge and skills between users. A balance between the population of users taking A and B strategies that approximates 2:1, is found to be optimal to the sustainable growth of communities.

During the last 40 years evidence from systematic case study analysis and behavioral experiments have provided a comprehensive perspective on how communities can manage common resources in a sustainable way. The conventional theory based on selfish rational actors cannot explain empirical observations. A more comprehensive theoretical framework of human behavior is emerging that include concepts such as trust, conditional cooperation, other-regarding preferences, social norms, and reputation. The new behavioral perspective also demonstrates that behavioral responses depend on social and biophysical context.

Most previous works on complete synchronization of chaotic oscillators focused on the one-channel interaction scheme where the oscillators are coupled through only one variable or a symmetric set of variables. Using the standard framework of master-stability function (MSF), we investigate the emergence of complex synchronization behaviors under all possible configurations of two-channel coupling, which include, for example, all possible cross coupling schemes among the dynamical variables. Utilizing the classic Rössler and Lorenz oscillators, we find a rich variety of synchronization phenomena not present in any previously extensively studied, single-channel coupling configurations. For example, in many cases two coupling channels can enhance or even generate synchronization where there is only weak or no synchronization under only one coupling channel, which has been verified in a coupled neuron system. There are also cases where the oscillators are originally synchronized under one coupling channel, but an additional synchronizable coupling channel can, however, destroy synchronization. Direct numerical simulations of actual synchronization dynamics verify the MSF-based predictions. Our extensive computation and heuristic analysis provide an atlas for synchronization of chaotic oscillators coupled through two channels, which can be used as a systematic reference to facilitate further research in this area.

Recently, there has been an increased interest in using behavioral experiments to study hypotheses on the governance of social-ecological systems. A diversity of software tools are used to implement such experiments. We evaluated various publicly available platforms that could be used in research and education on the governance of social-ecological systems. The aims of the various platforms are distinct, and this is noticeable in the differences in their user-friendliness and their adaptability to novel research questions. The more easily accessible platforms are useful for prototyping experiments and for educational purposes to illustrate theoretical concepts. To advance novel research aims, more elaborate programming experience is required to either implement an experiment from scratch or adjust existing experimental software. There is no ideal platform best suited for all possible use cases, but we have provided a menu of options and their associated trade-offs.

We find that the flow of attention on the Web forms a directed, tree-like structure implying the time-sensitive browsing behavior of users. Using the data of a news sharing website, we construct clickstream networks in which nodes are news stories and edges represent the consecutive clicks between two stories. To identify the flow direction of clickstreams, we define the “flow distance” of nodes (L_i), which measures the average number of steps a random walker takes to reach the ith node. It is observed that L_i is related with the clicks (C_i) to news stories and the age (T_i) of stories. Putting these three variables together help us understand the rise and decay of news stories from a network perspective. We also find that the studied clickstream networks preserve a stable structure over time, leading to the scaling between users and clicks. The universal scaling behavior is confirmed by the 1,000 Web forums. We suggest that the tree-like, stable structure of clickstream networks reveals the time-sensitive preference of users in online browsing. To test our assumption, we discuss three models on individual browsing behavior, and compare the simulation results with empirical data.

Resource allocation takes place in various types of real-world complex systems such as urban traffic, social services institutions, economical and ecosystems. Mathematically, the dynamical process of resource allocation can be modeled as minority games. Spontaneous evolution of the resource allocation dynamics, however, often leads to a harmful herding behavior accompanied by strong fluctuations in which a large majority of agents crowd temporarily for a few resources, leaving many others unused. Developing effective control methods to suppress and eliminate herding is an important but open problem. Here we develop a pinning control method, that the fluctuations of the system consist of intrinsic and systematic components allows us to design a control scheme with separated control variables. A striking finding is the universal existence of an optimal pinning fraction to minimize the variance of the system, regardless of the pinning patterns and the network topology. We carry out a generally applicable theory to explain the emergence of optimal pinning and to predict the dependence of the optimal pinning fraction on the network topology. Our work represents a general framework to deal with the broader problem of controlling collective dynamics in complex systems with potential applications in social, economical and political systems.