Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAdaptive cyclically dominating game on co-evolving networks: Numerical and analytic results
105
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
A co-evolving and adaptive Rock (R)-Paper (P)-Scissors (S) game (ARPS) in which an agent uses one of three cyclically dominating strategies is proposed and studied numerically and analytically. An agent takes adaptive actions to achieve a neighborhood to his advantage by rewiring a dissatisfying link with a probability $p$ or switching strategy with a probability $1-p$. Numerical results revealed two phases in the steady state. An active phase for $p<p_{text{cri}}$ has one connected network of agents using different strategies who are continually interacting and taking adaptive actions. A frozen phase for $p>p_{text{cri}}$ has three separate clusters of agents using only R, P, and S, respectively with terminated adaptive actions. A mean-field theory of link densities in co-evolving network is formulated in a general way that can be readily modified to other co-evolving network problems of multiple strategies. The analytic results agree with simulation results on ARPS well. We point out the different probabilities of winning, losing, and drawing a game among the agents as the origin of the small discrepancy between analytic and simulation results. As a result of the adaptive actions, agents of higher degrees are often those being taken advantage of. Agents with a smaller (larger) degree than the mean degree have a higher (smaller) probability of winning than losing. The results are useful in future attempts on formulating more accurate theories.
rate research
Read More
Social networks are not static but rather constantly evolve in time. One of the elements thought to drive the evolution of social network structure is homophily - the need for individuals to connect with others who are similar to them. In this paper, we study how the spread of a new opinion, idea, or behavior on such a homophily-driven social network is affected by the changing network structure. In particular, using simulations, we study a variant of the Axelrod model on a network with a homophilic rewiring rule imposed. First, we find that the presence of homophilic rewiring within the network, in general, impedes the reaching of consensus in opinion, as the time to reach consensus diverges exponentially with network size $N$. We then investigate whether the introduction of committed individuals who are rigid in their opinion on a particular issue, can speed up the convergence to consensus on that issue. We demonstrate that as committed agents are added, beyond a critical value of the committed fraction, the consensus time growth becomes logarithmic in network size $N$. Furthermore, we show that slight changes in the interaction rule can produce strikingly different results in the scaling behavior of $T_c$. However, the benefit gained by introducing committed agents is qualitatively preserved across all the interaction rules we consider.
The force of the ethnic separatism, essentially origining from negative effect of ethnic identity, is damaging the stability and harmony of multiethnic countries. In order to eliminate the foundation of the ethnic separatism and set up a harmonious ethnic relationship, some scholars have proposed a viewpoint: ethnic harmony could be promoted by popularizing civic identity. However, this viewpoint is discussed only from a philosophical prospective and still lack supports of scientific evidences. Because ethic group and ethnic identity are products of evolution and ethnic identity is the parochialism strategy under the perspective of game theory, this paper proposes an evolutionary game simulation model to study the relationship between civic identity and ethnic conflict based on evolutionary game theory. The simulation results indicate that: 1) the ratio of individuals with civic identity has a positive association with the frequency of ethnic conflicts; 2) ethnic conflict will not die out by killing all ethnic members once for all, and it also cannot be reduced by a forcible pressure, i.e., increasing the ratio of individuals with civic identity; 3) the average frequencies of conflicts can stay in a low level by promoting civic identity periodically and persistently.
A model for epidemic spreading on rewiring networks is introduced and analyzed for the case of scale free steady state networks. It is found that contrary to what one would have naively expected, the rewiring process typically tends to suppress epidemic spreading. In particular it is found that as in static networks, rewiring networks with degree distribution exponent $gamma >3$ exhibit a threshold in the infection rate below which epidemics die out in the steady state. However the threshold is higher in the rewiring case. For $2<gamma leq 3$ no such threshold exists, but for small infection rate the steady state density of infected nodes (prevalence) is smaller for rewiring networks.
The aim of this paper is to derive macroscopic equations for processes on large co-evolving networks, examples being opinion polarization with the emergence of filter bubbles or other social processes such as norm development. This leads to processes on graphs (or networks), where both the states of particles in nodes as well as the weights between them are updated in time. In our derivation we follow the basic paradigm of statistical mechanics: We start from paradigmatic microscopic models and derive a Liouville-type equation in a high-dimensional space including not only the node states in the network (corresponding to positions in mechanics), but also the edge weights between them. We then derive a natural (finite) marginal hierarchy and pass to an infinite limit. We will discuss the closure problem for this hierarchy and see that a simple mean-field solution can only arise if the weight distributions between nodes of equal states are concentrated. In a more interesting general case we propose a suitable closure at the level of a two-particle distribution (including the weight between them) and discuss some properties of the arising kinetic equations. Moreover, we highlight some structure-preserving properties of this closure and discuss its analysis in a minimal model. We discuss the application of our theory to some agent-based models in literature and discuss some open mathematical issues.
There is currently growing interest in modeling the information diffusion on social networks across multi-disciplines. The majority of the corresponding research has focused on information diffusion independently, ignoring the network evolution in the diffusion process. Therefore, it is more reasonable to describe the real diffusion systems by the co-evolution between network topologies and information states. In this work, we propose a mechanism considering the coevolution between information states and network topology simultaneously, in which the information diffusion was executed as an SIS process and network topology evolved based on the adaptive assumption. The theoretical analyses based on the Markov approach were very consistent with simulation. Both simulation results and theoretical analyses indicated that the adaptive process, in which informed individuals would rewire the links between the informed neighbors to a random non-neighbor node, can enhance information diffusion (leading to much broader spreading). In addition, we obtained that two threshold values exist for the information diffusion on adaptive networks, i.e., if the information propagation probability is less than the first threshold, information cannot diffuse and dies out immediately; if the propagation probability is between the first and second threshold, information will spread to a finite range and die out gradually; and if the propagation probability is larger than the second threshold, information will diffuse to a certain size of population in the network. These results may shed some light on understanding the co-evolution between information diffusion and network topology.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
