Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEvolution of ethnocentrism on undirected and directed Barabasi-Albert networks
122
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Using Monte Carlo simulations, we study the evolution of contigent cooperation and ethnocentrism in the one-move game. Interactions and reproduction among computational agents are simulated on {it undirected} and {it directed} Barabasi-Albert (BA) networks. We first replicate the Hammond-Axelrod model of in-group favoritism on a square lattice and then generalize this model on {it undirected} and {it directed} BA networks for both asexual and sexual reproduction cases. Our simulations demonstrate that irrespective of the mode of reproduction, ethnocentric strategy becomes common even though cooperation is individually costly and mechanisms such as reciprocity or conformity are absent. Moreover, our results indicate that the spread of favoritism toward similar others highly depends on the network topology and the associated heterogeneity of the studied population.
rate research
Read More
On directed and undirected Barabasi-Albert networks the Ising model with spin S=1/2 in the presence of a kind of noise is now studied through Monte Carlo simulations. The noise spectrum P(n) follows a power law, where P(n) is the probability of flipping randomly select n spins at each time step. The noise spectrum P(n) is introduced to mimic the self-organized criticality as a model influence of a complex environment. In this model, different from the square lattice, the order-disorder phase transition of the order parameter is not observed. For directed Barabasi-Albert networks the magnetisation tends to zero exponentially and for undirected Barabasi-Albert networks, it remains constant.
In usual scale-free networks of Barabasi-Albert type, a newly added node selects randomly m neighbors from the already existing network nodes, proportionally to the number of links these had before. Then the number N(k) of nodes with k links each decays as 1/k^gamma where gamma=3 is universal, i.e. independent of m. Now we use a limited directedness in the construction of the network, as a result of which the exponent gamma decreases from 3 to 2 for increasing m.
We consider two consensus formation models coupled to Barabasi-Albert networks, namely the Majority Vote model and Biswas-Chatterjee-Sen model. Recent works point to a non-universal behavior of the Majority Vote model, where the critical exponents have a dependence on the connectivity while the effective dimension $D_mathrm{eff} = 2beta/ u + gamma/ u$ of the lattice is unity. We considered a generalization of the scaling relations in order to include logarithmic corrections. We obtained the leading critical exponent ratios $1/ u$, $beta/ u$, and $gamma/ u$ by finite size scaling data collapses, as well as the logarithmic correction pseudo-exponents $widehat{lambda}$, $widehat{beta}+betawidehat{lambda}$, and $widehat{gamma}-gammawidehat{lambda}$. By comparing the scaling behaviors of the Majority Vote and Biswas-Chatterjee-Sen models, we argue that the exponents of Majority Vote model, in fact, are universal. Therefore, they do not depend on network connectivity. In addition, the critical exponents and the universality class are the same of Biswas-Chatterjee-Sen model, as seen for periodic and random graphs. However, the Majority Vote model has logarithmic corrections on its scaling properties, while Biswas-Chatterjee-Sen model follows usual scaling relations without logarithmic corrections.
We check the existence of a spontaneous magnetisation of Ising and Potts spins on semi-directed Barabasi-Albert networks by Monte Carlo simulations. We verified that the magnetisation for different temperatures $T$ decays after a characteristic time $tau(T)$, which we extrapolate to diverge at positive temperatures $T_c(N)$ by a Vogel-Fulcher law, with $T_c(N)$ increasing logarithmically with network size $N$.
Barabasi-Albert model describes many different natural networks, often yielding sensible explanations to the subjacent dynamics. However, finite size effects may prevent from discerning among different underlying physical mechanisms and from determining whether a particular finite system is driven by Barabasi-Albert dynamics. Here we propose master equations for the evolution of the degrees, links and triangles distributions, solve them both analytically and by numerical iteration, and compare with numerical simulations. The analytic solutions for all these distributions predict the network evolution for systems as small as 100 nodes. The analytic method we developed is applicable for other classes of networks, representing a powerful tool to investigate the evolution of natural networks.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
